./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/bitvector/soft_float_1-3a.c.cil.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:40:44,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:40:44,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:40:44,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:40:44,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:40:44,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:40:44,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:40:44,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:40:44,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:40:44,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:40:44,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:40:44,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:40:44,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:40:44,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:40:44,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:40:44,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:40:44,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:40:44,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:40:44,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:40:44,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:40:44,225 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:40:44,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:40:44,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:40:44,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:40:44,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:40:44,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:40:44,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:40:44,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:40:44,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:40:44,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:40:44,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:40:44,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:40:44,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:40:44,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:40:44,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:40:44,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:40:44,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:40:44,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:40:44,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:40:44,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:40:44,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:40:44,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:40:44,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:40:44,262 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:40:44,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:40:44,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:40:44,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:40:44,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:40:44,263 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:40:44,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:40:44,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:40:44,264 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:40:44,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:40:44,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:40:44,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:40:44,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:40:44,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:40:44,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:40:44,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:40:44,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:40:44,266 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:40:44,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:40:44,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:40:44,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:40:44,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:40:44,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:40:44,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:40:44,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:40:44,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:40:44,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:40:44,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:40:44,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:40:44,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:40:44,268 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:40:44,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:40:44,269 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:40:44,269 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-07-11 23:40:44,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:40:44,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:40:44,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:40:44,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:40:44,470 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:40:44,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-11 23:40:44,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4454ea410/451c6b3a861e426796c6469d123ffedb/FLAG5017b5f1d [2022-07-11 23:40:44,863 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:40:44,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-11 23:40:44,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4454ea410/451c6b3a861e426796c6469d123ffedb/FLAG5017b5f1d [2022-07-11 23:40:45,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4454ea410/451c6b3a861e426796c6469d123ffedb [2022-07-11 23:40:45,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:40:45,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:40:45,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:40:45,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:40:45,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:40:45,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f885b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45, skipping insertion in model container [2022-07-11 23:40:45,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:40:45,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:40:45,415 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-11 23:40:45,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:40:45,511 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:40:45,518 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-11 23:40:45,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:40:45,568 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:40:45,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45 WrapperNode [2022-07-11 23:40:45,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:40:45,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:40:45,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:40:45,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:40:45,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,598 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 213 [2022-07-11 23:40:45,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:40:45,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:40:45,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:40:45,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:40:45,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:40:45,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:40:45,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:40:45,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:40:45,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (1/1) ... [2022-07-11 23:40:45,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:40:45,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:45,665 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-11 23:40:45,667 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-11 23:40:45,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:40:45,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:40:45,703 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-11 23:40:45,703 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-11 23:40:45,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:40:45,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:40:45,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-11 23:40:45,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-11 23:40:45,766 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:40:45,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:40:46,099 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:40:46,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:40:46,104 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-11 23:40:46,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:40:46 BoogieIcfgContainer [2022-07-11 23:40:46,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:40:46,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:40:46,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:40:46,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:40:46,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:40:45" (1/3) ... [2022-07-11 23:40:46,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7d86db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:40:46, skipping insertion in model container [2022-07-11 23:40:46,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:40:45" (2/3) ... [2022-07-11 23:40:46,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7d86db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:40:46, skipping insertion in model container [2022-07-11 23:40:46,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:40:46" (3/3) ... [2022-07-11 23:40:46,112 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-07-11 23:40:46,120 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:40:46,121 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:40:46,163 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:40:46,171 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@18d7910e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@108467da [2022-07-11 23:40:46,172 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:40:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 96 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-11 23:40:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:40:46,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:46,182 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:46,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash 814386124, now seen corresponding path program 1 times [2022-07-11 23:40:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:46,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953569304] [2022-07-11 23:40:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:46,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:46,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953569304] [2022-07-11 23:40:46,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953569304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:46,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:46,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:40:46,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054244154] [2022-07-11 23:40:46,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:46,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:40:46,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:40:46,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:40:46,459 INFO L87 Difference]: Start difference. First operand has 106 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 96 states have internal predecessors, (160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:46,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:46,585 INFO L93 Difference]: Finished difference Result 276 states and 481 transitions. [2022-07-11 23:40:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:40:46,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-07-11 23:40:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:46,599 INFO L225 Difference]: With dead ends: 276 [2022-07-11 23:40:46,599 INFO L226 Difference]: Without dead ends: 165 [2022-07-11 23:40:46,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11 23:40:46,607 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 110 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:46,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 419 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:40:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-11 23:40:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2022-07-11 23:40:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 132 states have (on average 1.5) internal successors, (198), 134 states have internal predecessors, (198), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-11 23:40:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2022-07-11 23:40:46,656 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 37 [2022-07-11 23:40:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:46,658 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2022-07-11 23:40:46,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2022-07-11 23:40:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:40:46,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:46,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:46,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:40:46,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2116308935, now seen corresponding path program 1 times [2022-07-11 23:40:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:46,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916918390] [2022-07-11 23:40:46,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:46,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916918390] [2022-07-11 23:40:46,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916918390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:46,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:46,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:40:46,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356774529] [2022-07-11 23:40:46,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:46,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:40:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:46,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:40:46,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:40:46,739 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:46,806 INFO L93 Difference]: Finished difference Result 275 states and 414 transitions. [2022-07-11 23:40:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:40:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-07-11 23:40:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:46,811 INFO L225 Difference]: With dead ends: 275 [2022-07-11 23:40:46,813 INFO L226 Difference]: Without dead ends: 236 [2022-07-11 23:40:46,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11 23:40:46,818 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 102 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:46,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 436 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-11 23:40:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 219. [2022-07-11 23:40:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 198 states have (on average 1.4595959595959596) internal successors, (289), 201 states have internal predecessors, (289), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-11 23:40:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2022-07-11 23:40:46,836 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 39 [2022-07-11 23:40:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:46,837 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2022-07-11 23:40:46,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2022-07-11 23:40:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 23:40:46,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:46,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:46,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:40:46,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:46,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1123536244, now seen corresponding path program 1 times [2022-07-11 23:40:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:46,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520337755] [2022-07-11 23:40:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:46,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:46,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520337755] [2022-07-11 23:40:46,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520337755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:46,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:46,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:40:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219843987] [2022-07-11 23:40:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:46,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:40:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:40:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:40:46,890 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:46,959 INFO L93 Difference]: Finished difference Result 353 states and 525 transitions. [2022-07-11 23:40:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:40:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-11 23:40:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:46,961 INFO L225 Difference]: With dead ends: 353 [2022-07-11 23:40:46,961 INFO L226 Difference]: Without dead ends: 321 [2022-07-11 23:40:46,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:40:46,966 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 206 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:46,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 702 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-11 23:40:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 273. [2022-07-11 23:40:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.4615384615384615) internal successors, (361), 251 states have internal predecessors, (361), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-11 23:40:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 405 transitions. [2022-07-11 23:40:46,979 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 405 transitions. Word has length 40 [2022-07-11 23:40:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:46,980 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 405 transitions. [2022-07-11 23:40:46,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 405 transitions. [2022-07-11 23:40:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 23:40:46,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:46,981 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:46,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:40:46,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash 102467890, now seen corresponding path program 1 times [2022-07-11 23:40:46,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:46,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486644961] [2022-07-11 23:40:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:47,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486644961] [2022-07-11 23:40:47,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486644961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:47,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:47,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:40:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369816910] [2022-07-11 23:40:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:40:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:47,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:40:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:40:47,018 INFO L87 Difference]: Start difference. First operand 273 states and 405 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:47,051 INFO L93 Difference]: Finished difference Result 294 states and 435 transitions. [2022-07-11 23:40:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:40:47,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-07-11 23:40:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:47,052 INFO L225 Difference]: With dead ends: 294 [2022-07-11 23:40:47,052 INFO L226 Difference]: Without dead ends: 287 [2022-07-11 23:40:47,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11 23:40:47,053 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 45 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:47,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 402 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-11 23:40:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2022-07-11 23:40:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 248 states have (on average 1.4596774193548387) internal successors, (362), 252 states have internal predecessors, (362), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-11 23:40:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 406 transitions. [2022-07-11 23:40:47,063 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 406 transitions. Word has length 40 [2022-07-11 23:40:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:47,063 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 406 transitions. [2022-07-11 23:40:47,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 406 transitions. [2022-07-11 23:40:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:40:47,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:47,064 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:47,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:40:47,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:47,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash 991244780, now seen corresponding path program 1 times [2022-07-11 23:40:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:47,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102810972] [2022-07-11 23:40:47,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:47,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:47,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102810972] [2022-07-11 23:40:47,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102810972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767011731] [2022-07-11 23:40:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:47,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:47,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:47,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:47,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:40:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:47,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-11 23:40:47,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:40:47,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:40:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:47,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767011731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:40:47,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:40:47,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2022-07-11 23:40:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636729999] [2022-07-11 23:40:47,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:40:47,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:40:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:40:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:40:47,544 INFO L87 Difference]: Start difference. First operand 274 states and 406 transitions. Second operand has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-11 23:40:48,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:48,038 INFO L93 Difference]: Finished difference Result 561 states and 855 transitions. [2022-07-11 23:40:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-11 23:40:48,038 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 41 [2022-07-11 23:40:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:48,040 INFO L225 Difference]: With dead ends: 561 [2022-07-11 23:40:48,040 INFO L226 Difference]: Without dead ends: 290 [2022-07-11 23:40:48,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:40:48,043 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 467 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:48,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1545 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:40:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-11 23:40:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 173. [2022-07-11 23:40:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 153 states have (on average 1.4379084967320261) internal successors, (220), 156 states have internal predecessors, (220), 15 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (20), 15 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-11 23:40:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2022-07-11 23:40:48,060 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 41 [2022-07-11 23:40:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:48,062 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2022-07-11 23:40:48,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.875) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-11 23:40:48,062 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2022-07-11 23:40:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:40:48,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:48,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:48,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:48,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:48,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash 493844178, now seen corresponding path program 1 times [2022-07-11 23:40:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:48,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686170403] [2022-07-11 23:40:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:48,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:48,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686170403] [2022-07-11 23:40:48,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686170403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:48,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:48,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:40:48,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645651314] [2022-07-11 23:40:48,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:48,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:40:48,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:48,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:40:48,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:40:48,315 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:48,356 INFO L93 Difference]: Finished difference Result 205 states and 303 transitions. [2022-07-11 23:40:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:40:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-11 23:40:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:48,357 INFO L225 Difference]: With dead ends: 205 [2022-07-11 23:40:48,357 INFO L226 Difference]: Without dead ends: 179 [2022-07-11 23:40:48,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:40:48,358 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 174 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:48,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 576 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:48,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-11 23:40:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 163. [2022-07-11 23:40:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 147 states have internal predecessors, (206), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-11 23:40:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2022-07-11 23:40:48,363 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 43 [2022-07-11 23:40:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:48,363 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2022-07-11 23:40:48,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2022-07-11 23:40:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:40:48,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:48,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:48,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:40:48,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1964302618, now seen corresponding path program 1 times [2022-07-11 23:40:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:48,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204682298] [2022-07-11 23:40:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:48,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:48,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204682298] [2022-07-11 23:40:48,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204682298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:48,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:48,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:40:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002605209] [2022-07-11 23:40:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:48,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:40:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:40:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:40:48,393 INFO L87 Difference]: Start difference. First operand 163 states and 237 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:48,427 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2022-07-11 23:40:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:40:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-11 23:40:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:48,428 INFO L225 Difference]: With dead ends: 185 [2022-07-11 23:40:48,428 INFO L226 Difference]: Without dead ends: 178 [2022-07-11 23:40:48,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:40:48,429 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:48,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 536 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-11 23:40:48,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2022-07-11 23:40:48,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 146 states have (on average 1.417808219178082) internal successors, (207), 148 states have internal predecessors, (207), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-11 23:40:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 238 transitions. [2022-07-11 23:40:48,434 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 238 transitions. Word has length 44 [2022-07-11 23:40:48,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:48,434 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 238 transitions. [2022-07-11 23:40:48,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 238 transitions. [2022-07-11 23:40:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:40:48,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:48,435 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:48,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:40:48,435 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:48,435 INFO L85 PathProgramCache]: Analyzing trace with hash -189295256, now seen corresponding path program 1 times [2022-07-11 23:40:48,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:48,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570237050] [2022-07-11 23:40:48,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:48,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:48,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:48,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570237050] [2022-07-11 23:40:48,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570237050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:48,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:48,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:40:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872894534] [2022-07-11 23:40:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:48,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:40:48,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:48,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:40:48,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:40:48,476 INFO L87 Difference]: Start difference. First operand 164 states and 238 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:48,523 INFO L93 Difference]: Finished difference Result 179 states and 258 transitions. [2022-07-11 23:40:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:40:48,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-11 23:40:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:48,525 INFO L225 Difference]: With dead ends: 179 [2022-07-11 23:40:48,526 INFO L226 Difference]: Without dead ends: 172 [2022-07-11 23:40:48,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:40:48,526 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 42 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:48,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 678 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-11 23:40:48,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-07-11 23:40:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 144 states have (on average 1.4097222222222223) internal successors, (203), 146 states have internal predecessors, (203), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (18), 13 states have call predecessors, (18), 12 states have call successors, (18) [2022-07-11 23:40:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2022-07-11 23:40:48,537 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2022-07-11 23:40:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:48,537 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2022-07-11 23:40:48,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2022-07-11 23:40:48,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:40:48,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:48,538 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:48,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:40:48,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:48,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1232722459, now seen corresponding path program 1 times [2022-07-11 23:40:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:48,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082892914] [2022-07-11 23:40:48,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:48,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:48,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082892914] [2022-07-11 23:40:48,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082892914] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:48,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444396960] [2022-07-11 23:40:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:48,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:48,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:48,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:48,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:40:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:48,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-11 23:40:48,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:40:48,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:40:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:48,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444396960] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:48,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:40:48,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 17 [2022-07-11 23:40:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871851725] [2022-07-11 23:40:48,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:48,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:40:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:48,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:40:48,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:40:48,862 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:48,914 INFO L93 Difference]: Finished difference Result 392 states and 564 transitions. [2022-07-11 23:40:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:40:48,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-11 23:40:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:48,916 INFO L225 Difference]: With dead ends: 392 [2022-07-11 23:40:48,916 INFO L226 Difference]: Without dead ends: 280 [2022-07-11 23:40:48,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:40:48,917 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 85 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:48,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 707 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-11 23:40:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2022-07-11 23:40:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 250 states have (on average 1.392) internal successors, (348), 251 states have internal predecessors, (348), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-11 23:40:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2022-07-11 23:40:48,924 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 395 transitions. Word has length 45 [2022-07-11 23:40:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:48,924 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 395 transitions. [2022-07-11 23:40:48,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 395 transitions. [2022-07-11 23:40:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:40:48,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:48,925 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:48,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:49,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-11 23:40:49,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash 221605209, now seen corresponding path program 1 times [2022-07-11 23:40:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:49,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831599685] [2022-07-11 23:40:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:49,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:49,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831599685] [2022-07-11 23:40:49,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831599685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:49,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:49,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:40:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719068368] [2022-07-11 23:40:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:49,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:40:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:49,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:40:49,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:40:49,169 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:49,218 INFO L93 Difference]: Finished difference Result 422 states and 604 transitions. [2022-07-11 23:40:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:40:49,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-11 23:40:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:49,220 INFO L225 Difference]: With dead ends: 422 [2022-07-11 23:40:49,220 INFO L226 Difference]: Without dead ends: 382 [2022-07-11 23:40:49,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:40:49,221 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 186 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:49,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 538 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-11 23:40:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 311. [2022-07-11 23:40:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 284 states have (on average 1.3873239436619718) internal successors, (394), 284 states have internal predecessors, (394), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (27), 24 states have call predecessors, (27), 21 states have call successors, (27) [2022-07-11 23:40:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 443 transitions. [2022-07-11 23:40:49,231 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 443 transitions. Word has length 45 [2022-07-11 23:40:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:49,231 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 443 transitions. [2022-07-11 23:40:49,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 443 transitions. [2022-07-11 23:40:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:40:49,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:49,232 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:49,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:40:49,232 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:49,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2044635565, now seen corresponding path program 1 times [2022-07-11 23:40:49,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:49,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206569030] [2022-07-11 23:40:49,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:49,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:49,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206569030] [2022-07-11 23:40:49,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206569030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:49,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362579185] [2022-07-11 23:40:49,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:49,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:49,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:49,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:40:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-11 23:40:49,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:49,417 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:49,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:40:49,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362579185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:49,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:40:49,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-11 23:40:49,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710498412] [2022-07-11 23:40:49,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:49,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:40:49,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:49,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:40:49,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:40:49,420 INFO L87 Difference]: Start difference. First operand 311 states and 443 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:49,548 INFO L93 Difference]: Finished difference Result 613 states and 868 transitions. [2022-07-11 23:40:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:40:49,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-07-11 23:40:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:49,550 INFO L225 Difference]: With dead ends: 613 [2022-07-11 23:40:49,551 INFO L226 Difference]: Without dead ends: 587 [2022-07-11 23:40:49,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:40:49,552 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 181 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:49,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 745 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:40:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-07-11 23:40:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 467. [2022-07-11 23:40:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 428 states have (on average 1.3574766355140186) internal successors, (581), 429 states have internal predecessors, (581), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (39), 36 states have call predecessors, (39), 33 states have call successors, (39) [2022-07-11 23:40:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 654 transitions. [2022-07-11 23:40:49,568 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 654 transitions. Word has length 48 [2022-07-11 23:40:49,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:49,568 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 654 transitions. [2022-07-11 23:40:49,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 654 transitions. [2022-07-11 23:40:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:40:49,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:49,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:49,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:49,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:49,786 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:49,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1343570987, now seen corresponding path program 1 times [2022-07-11 23:40:49,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:49,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429871791] [2022-07-11 23:40:49,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:49,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:49,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429871791] [2022-07-11 23:40:49,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429871791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:49,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:49,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:40:49,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45335658] [2022-07-11 23:40:49,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:49,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:40:49,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:49,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:40:49,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:40:49,827 INFO L87 Difference]: Start difference. First operand 467 states and 654 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:49,865 INFO L93 Difference]: Finished difference Result 491 states and 685 transitions. [2022-07-11 23:40:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:40:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-07-11 23:40:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:49,867 INFO L225 Difference]: With dead ends: 491 [2022-07-11 23:40:49,867 INFO L226 Difference]: Without dead ends: 451 [2022-07-11 23:40:49,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:40:49,868 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 38 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:49,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 528 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-11 23:40:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 443. [2022-07-11 23:40:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 404 states have (on average 1.3514851485148516) internal successors, (546), 405 states have internal predecessors, (546), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (38), 35 states have call predecessors, (38), 32 states have call successors, (38) [2022-07-11 23:40:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 618 transitions. [2022-07-11 23:40:49,884 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 618 transitions. Word has length 48 [2022-07-11 23:40:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:49,884 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 618 transitions. [2022-07-11 23:40:49,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 618 transitions. [2022-07-11 23:40:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:40:49,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:49,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:49,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:40:49,886 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:49,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:49,886 INFO L85 PathProgramCache]: Analyzing trace with hash 502143871, now seen corresponding path program 1 times [2022-07-11 23:40:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:49,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809452588] [2022-07-11 23:40:49,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:49,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809452588] [2022-07-11 23:40:49,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809452588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:49,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:49,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:40:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700576575] [2022-07-11 23:40:49,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:49,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:40:49,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:40:49,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:40:49,924 INFO L87 Difference]: Start difference. First operand 443 states and 618 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:49,977 INFO L93 Difference]: Finished difference Result 840 states and 1171 transitions. [2022-07-11 23:40:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:40:49,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-07-11 23:40:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:49,979 INFO L225 Difference]: With dead ends: 840 [2022-07-11 23:40:49,980 INFO L226 Difference]: Without dead ends: 524 [2022-07-11 23:40:49,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-11 23:40:49,981 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 75 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:49,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 426 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-07-11 23:40:49,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 448. [2022-07-11 23:40:49,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 409 states have (on average 1.3227383863080684) internal successors, (541), 410 states have internal predecessors, (541), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (38), 35 states have call predecessors, (38), 32 states have call successors, (38) [2022-07-11 23:40:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 613 transitions. [2022-07-11 23:40:49,994 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 613 transitions. Word has length 48 [2022-07-11 23:40:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:49,994 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 613 transitions. [2022-07-11 23:40:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 613 transitions. [2022-07-11 23:40:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:40:49,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:49,995 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:49,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:40:49,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:49,996 INFO L85 PathProgramCache]: Analyzing trace with hash -50490859, now seen corresponding path program 1 times [2022-07-11 23:40:49,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:49,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076886385] [2022-07-11 23:40:49,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:50,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076886385] [2022-07-11 23:40:50,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076886385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:50,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:50,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:40:50,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283699058] [2022-07-11 23:40:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:50,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:40:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:40:50,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:40:50,095 INFO L87 Difference]: Start difference. First operand 448 states and 613 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:40:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:50,266 INFO L93 Difference]: Finished difference Result 622 states and 846 transitions. [2022-07-11 23:40:50,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:40:50,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-11 23:40:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:50,268 INFO L225 Difference]: With dead ends: 622 [2022-07-11 23:40:50,268 INFO L226 Difference]: Without dead ends: 533 [2022-07-11 23:40:50,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:40:50,269 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 122 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:50,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1660 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:40:50,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-07-11 23:40:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 445. [2022-07-11 23:40:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 406 states have (on average 1.3251231527093597) internal successors, (538), 408 states have internal predecessors, (538), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (36), 34 states have call predecessors, (36), 32 states have call successors, (36) [2022-07-11 23:40:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 608 transitions. [2022-07-11 23:40:50,281 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 608 transitions. Word has length 48 [2022-07-11 23:40:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:50,281 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 608 transitions. [2022-07-11 23:40:50,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:40:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 608 transitions. [2022-07-11 23:40:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 23:40:50,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:50,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:50,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:40:50,283 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1297236278, now seen corresponding path program 1 times [2022-07-11 23:40:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:50,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235640334] [2022-07-11 23:40:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:40:50,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235640334] [2022-07-11 23:40:50,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235640334] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:50,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33941845] [2022-07-11 23:40:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:50,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:50,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:50,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:40:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:50,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-11 23:40:50,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:40:50,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:40:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:40:50,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33941845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:40:50,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:40:50,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-07-11 23:40:50,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742527056] [2022-07-11 23:40:50,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:40:50,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-11 23:40:50,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:50,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-11 23:40:50,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:40:50,559 INFO L87 Difference]: Start difference. First operand 445 states and 608 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-11 23:40:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:51,032 INFO L93 Difference]: Finished difference Result 1186 states and 1619 transitions. [2022-07-11 23:40:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:40:51,033 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2022-07-11 23:40:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:51,035 INFO L225 Difference]: With dead ends: 1186 [2022-07-11 23:40:51,036 INFO L226 Difference]: Without dead ends: 808 [2022-07-11 23:40:51,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-07-11 23:40:51,037 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 551 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:51,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 2129 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:40:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-07-11 23:40:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 644. [2022-07-11 23:40:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 589 states have (on average 1.2767402376910018) internal successors, (752), 592 states have internal predecessors, (752), 49 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (56), 50 states have call predecessors, (56), 46 states have call successors, (56) [2022-07-11 23:40:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 857 transitions. [2022-07-11 23:40:51,055 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 857 transitions. Word has length 49 [2022-07-11 23:40:51,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:51,055 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 857 transitions. [2022-07-11 23:40:51,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-11 23:40:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 857 transitions. [2022-07-11 23:40:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:40:51,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:51,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:51,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:51,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-11 23:40:51,272 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2012462520, now seen corresponding path program 1 times [2022-07-11 23:40:51,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:51,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694624661] [2022-07-11 23:40:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:51,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:51,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 23:40:51,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:51,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694624661] [2022-07-11 23:40:51,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694624661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:51,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993278048] [2022-07-11 23:40:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:51,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:51,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:51,516 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:51,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:40:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:51,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-11 23:40:51,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:51,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:40:51,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993278048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:51,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:40:51,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 24 [2022-07-11 23:40:51,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613545298] [2022-07-11 23:40:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:51,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:40:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:51,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:40:51,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-07-11 23:40:51,744 INFO L87 Difference]: Start difference. First operand 644 states and 857 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:51,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:51,973 INFO L93 Difference]: Finished difference Result 842 states and 1127 transitions. [2022-07-11 23:40:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:40:51,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-11 23:40:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:51,975 INFO L225 Difference]: With dead ends: 842 [2022-07-11 23:40:51,975 INFO L226 Difference]: Without dead ends: 823 [2022-07-11 23:40:51,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:40:51,976 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 284 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:51,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1167 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:40:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2022-07-11 23:40:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 673. [2022-07-11 23:40:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 616 states have (on average 1.271103896103896) internal successors, (783), 620 states have internal predecessors, (783), 51 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (58), 52 states have call predecessors, (58), 48 states have call successors, (58) [2022-07-11 23:40:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 892 transitions. [2022-07-11 23:40:51,995 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 892 transitions. Word has length 50 [2022-07-11 23:40:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:51,996 INFO L495 AbstractCegarLoop]: Abstraction has 673 states and 892 transitions. [2022-07-11 23:40:51,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:51,996 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 892 transitions. [2022-07-11 23:40:51,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 23:40:51,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:51,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:52,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:52,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-11 23:40:52,216 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:52,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1388940720, now seen corresponding path program 1 times [2022-07-11 23:40:52,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:52,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010421165] [2022-07-11 23:40:52,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:52,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-11 23:40:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:52,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010421165] [2022-07-11 23:40:52,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010421165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:52,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:52,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:40:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681537476] [2022-07-11 23:40:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:52,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:40:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:52,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:40:52,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:40:52,249 INFO L87 Difference]: Start difference. First operand 673 states and 892 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:52,326 INFO L93 Difference]: Finished difference Result 726 states and 965 transitions. [2022-07-11 23:40:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:40:52,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-07-11 23:40:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:52,328 INFO L225 Difference]: With dead ends: 726 [2022-07-11 23:40:52,328 INFO L226 Difference]: Without dead ends: 724 [2022-07-11 23:40:52,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:40:52,329 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 78 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:52,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 840 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-07-11 23:40:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 682. [2022-07-11 23:40:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 621 states have (on average 1.2689210950080516) internal successors, (788), 628 states have internal predecessors, (788), 54 states have call successors, (54), 4 states have call predecessors, (54), 6 states have return successors, (61), 52 states have call predecessors, (61), 51 states have call successors, (61) [2022-07-11 23:40:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 903 transitions. [2022-07-11 23:40:52,360 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 903 transitions. Word has length 51 [2022-07-11 23:40:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:52,361 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 903 transitions. [2022-07-11 23:40:52,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 903 transitions. [2022-07-11 23:40:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:40:52,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:52,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:52,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:40:52,362 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:52,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1800205628, now seen corresponding path program 1 times [2022-07-11 23:40:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:52,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841945411] [2022-07-11 23:40:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:40:52,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:52,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841945411] [2022-07-11 23:40:52,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841945411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:52,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:52,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:40:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706314451] [2022-07-11 23:40:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:52,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:40:52,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:52,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:40:52,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:40:52,385 INFO L87 Difference]: Start difference. First operand 682 states and 903 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:52,425 INFO L93 Difference]: Finished difference Result 699 states and 926 transitions. [2022-07-11 23:40:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:40:52,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-07-11 23:40:52,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:52,428 INFO L225 Difference]: With dead ends: 699 [2022-07-11 23:40:52,428 INFO L226 Difference]: Without dead ends: 673 [2022-07-11 23:40:52,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:40:52,428 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 38 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:52,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 516 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-11 23:40:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 567. [2022-07-11 23:40:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 515 states have (on average 1.2757281553398059) internal successors, (657), 521 states have internal predecessors, (657), 45 states have call successors, (45), 4 states have call predecessors, (45), 6 states have return successors, (52), 43 states have call predecessors, (52), 42 states have call successors, (52) [2022-07-11 23:40:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 754 transitions. [2022-07-11 23:40:52,443 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 754 transitions. Word has length 52 [2022-07-11 23:40:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:52,444 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 754 transitions. [2022-07-11 23:40:52,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 754 transitions. [2022-07-11 23:40:52,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:40:52,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:52,445 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:52,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:40:52,445 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:52,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2067118233, now seen corresponding path program 1 times [2022-07-11 23:40:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:52,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197293215] [2022-07-11 23:40:52,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-11 23:40:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:40:52,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:52,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197293215] [2022-07-11 23:40:52,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197293215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:52,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:52,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:40:52,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378410961] [2022-07-11 23:40:52,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:52,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:40:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:52,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:40:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:40:52,521 INFO L87 Difference]: Start difference. First operand 567 states and 754 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:40:52,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:52,693 INFO L93 Difference]: Finished difference Result 1253 states and 1690 transitions. [2022-07-11 23:40:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:40:52,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-07-11 23:40:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:52,697 INFO L225 Difference]: With dead ends: 1253 [2022-07-11 23:40:52,697 INFO L226 Difference]: Without dead ends: 1047 [2022-07-11 23:40:52,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:40:52,698 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 184 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:52,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1360 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:40:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2022-07-11 23:40:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 916. [2022-07-11 23:40:52,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 840 states have (on average 1.2642857142857142) internal successors, (1062), 847 states have internal predecessors, (1062), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (76), 68 states have call predecessors, (76), 66 states have call successors, (76) [2022-07-11 23:40:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1207 transitions. [2022-07-11 23:40:52,729 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1207 transitions. Word has length 57 [2022-07-11 23:40:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:52,729 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1207 transitions. [2022-07-11 23:40:52,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:40:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1207 transitions. [2022-07-11 23:40:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:40:52,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:52,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:52,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:40:52,731 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:52,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1155927203, now seen corresponding path program 1 times [2022-07-11 23:40:52,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538363706] [2022-07-11 23:40:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:52,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:52,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:52,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538363706] [2022-07-11 23:40:52,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538363706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:52,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746081002] [2022-07-11 23:40:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:52,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:52,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:52,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 23:40:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:52,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:40:52,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:52,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:52,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:40:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:52,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746081002] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:40:52,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:40:52,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-07-11 23:40:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461997768] [2022-07-11 23:40:52,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:40:52,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:40:52,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:52,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:40:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:40:52,942 INFO L87 Difference]: Start difference. First operand 916 states and 1207 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-11 23:40:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:53,129 INFO L93 Difference]: Finished difference Result 1645 states and 2177 transitions. [2022-07-11 23:40:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:40:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-07-11 23:40:53,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:53,133 INFO L225 Difference]: With dead ends: 1645 [2022-07-11 23:40:53,133 INFO L226 Difference]: Without dead ends: 1543 [2022-07-11 23:40:53,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:40:53,134 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 301 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:53,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 2254 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:40:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-07-11 23:40:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 928. [2022-07-11 23:40:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 852 states have (on average 1.2629107981220657) internal successors, (1076), 859 states have internal predecessors, (1076), 69 states have call successors, (69), 4 states have call predecessors, (69), 6 states have return successors, (76), 68 states have call predecessors, (76), 66 states have call successors, (76) [2022-07-11 23:40:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1221 transitions. [2022-07-11 23:40:53,182 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1221 transitions. Word has length 58 [2022-07-11 23:40:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:53,183 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1221 transitions. [2022-07-11 23:40:53,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 11 states have internal predecessors, (66), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-11 23:40:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1221 transitions. [2022-07-11 23:40:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:40:53,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:53,184 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:53,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:53,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:53,411 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1021913697, now seen corresponding path program 1 times [2022-07-11 23:40:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:53,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802890961] [2022-07-11 23:40:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:53,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:53,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-11 23:40:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:53,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:53,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:53,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802890961] [2022-07-11 23:40:53,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802890961] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:53,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957820023] [2022-07-11 23:40:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:53,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:53,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:53,504 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:53,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 23:40:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:53,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:40:53,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:53,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:40:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:53,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957820023] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:40:53,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:40:53,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-07-11 23:40:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543438651] [2022-07-11 23:40:53,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:40:53,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:40:53,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:40:53,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:40:53,701 INFO L87 Difference]: Start difference. First operand 928 states and 1221 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-11 23:40:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:54,001 INFO L93 Difference]: Finished difference Result 2168 states and 2928 transitions. [2022-07-11 23:40:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:40:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 58 [2022-07-11 23:40:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:54,010 INFO L225 Difference]: With dead ends: 2168 [2022-07-11 23:40:54,010 INFO L226 Difference]: Without dead ends: 2046 [2022-07-11 23:40:54,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-07-11 23:40:54,011 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 257 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:54,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 3240 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:40:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-07-11 23:40:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 908. [2022-07-11 23:40:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 833 states have (on average 1.2665066026410565) internal successors, (1055), 842 states have internal predecessors, (1055), 68 states have call successors, (68), 4 states have call predecessors, (68), 6 states have return successors, (72), 65 states have call predecessors, (72), 65 states have call successors, (72) [2022-07-11 23:40:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1195 transitions. [2022-07-11 23:40:54,048 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1195 transitions. Word has length 58 [2022-07-11 23:40:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:54,048 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1195 transitions. [2022-07-11 23:40:54,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 13 states have internal predecessors, (75), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-11 23:40:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1195 transitions. [2022-07-11 23:40:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:40:54,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:54,049 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:54,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:54,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:54,267 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:54,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:54,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1110635549, now seen corresponding path program 1 times [2022-07-11 23:40:54,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:54,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166317443] [2022-07-11 23:40:54,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:54,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:40:54,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:54,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166317443] [2022-07-11 23:40:54,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166317443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:54,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:54,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:40:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894232510] [2022-07-11 23:40:54,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:54,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:40:54,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:54,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:40:54,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:40:54,311 INFO L87 Difference]: Start difference. First operand 908 states and 1195 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:54,419 INFO L93 Difference]: Finished difference Result 958 states and 1256 transitions. [2022-07-11 23:40:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:40:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2022-07-11 23:40:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:54,422 INFO L225 Difference]: With dead ends: 958 [2022-07-11 23:40:54,422 INFO L226 Difference]: Without dead ends: 752 [2022-07-11 23:40:54,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:40:54,424 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 44 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:54,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 869 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:40:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-07-11 23:40:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 744. [2022-07-11 23:40:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 679 states have (on average 1.2709867452135493) internal successors, (863), 689 states have internal predecessors, (863), 59 states have call successors, (59), 4 states have call predecessors, (59), 5 states have return successors, (59), 54 states have call predecessors, (59), 56 states have call successors, (59) [2022-07-11 23:40:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 981 transitions. [2022-07-11 23:40:54,478 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 981 transitions. Word has length 58 [2022-07-11 23:40:54,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:54,478 INFO L495 AbstractCegarLoop]: Abstraction has 744 states and 981 transitions. [2022-07-11 23:40:54,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 981 transitions. [2022-07-11 23:40:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:40:54,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:54,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:54,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:40:54,480 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1691045042, now seen corresponding path program 1 times [2022-07-11 23:40:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:54,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100333737] [2022-07-11 23:40:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:54,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-11 23:40:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:40:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:54,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100333737] [2022-07-11 23:40:54,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100333737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:54,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:54,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:40:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386967174] [2022-07-11 23:40:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:54,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:40:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:54,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:40:54,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:40:54,499 INFO L87 Difference]: Start difference. First operand 744 states and 981 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:40:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:54,556 INFO L93 Difference]: Finished difference Result 1373 states and 1824 transitions. [2022-07-11 23:40:54,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:40:54,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 59 [2022-07-11 23:40:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:54,558 INFO L225 Difference]: With dead ends: 1373 [2022-07-11 23:40:54,558 INFO L226 Difference]: Without dead ends: 764 [2022-07-11 23:40:54,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:40:54,559 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 55 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:54,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 355 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-07-11 23:40:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 745. [2022-07-11 23:40:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 680 states have (on average 1.2705882352941176) internal successors, (864), 690 states have internal predecessors, (864), 59 states have call successors, (59), 4 states have call predecessors, (59), 5 states have return successors, (59), 54 states have call predecessors, (59), 56 states have call successors, (59) [2022-07-11 23:40:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 982 transitions. [2022-07-11 23:40:54,580 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 982 transitions. Word has length 59 [2022-07-11 23:40:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:54,580 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 982 transitions. [2022-07-11 23:40:54,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:40:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 982 transitions. [2022-07-11 23:40:54,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:40:54,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:54,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:54,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:40:54,581 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:54,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1304426309, now seen corresponding path program 1 times [2022-07-11 23:40:54,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:54,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177433522] [2022-07-11 23:40:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:54,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-11 23:40:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:40:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177433522] [2022-07-11 23:40:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177433522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924256299] [2022-07-11 23:40:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:54,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:54,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:54,707 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:54,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-11 23:40:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:54,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-11 23:40:54,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:40:55,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:40:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:40:55,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924256299] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:55,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:40:55,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 26 [2022-07-11 23:40:55,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457106289] [2022-07-11 23:40:55,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:55,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:40:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:55,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:40:55,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-07-11 23:40:55,431 INFO L87 Difference]: Start difference. First operand 745 states and 982 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:40:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:55,779 INFO L93 Difference]: Finished difference Result 1182 states and 1559 transitions. [2022-07-11 23:40:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:40:55,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2022-07-11 23:40:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:55,782 INFO L225 Difference]: With dead ends: 1182 [2022-07-11 23:40:55,782 INFO L226 Difference]: Without dead ends: 1147 [2022-07-11 23:40:55,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2022-07-11 23:40:55,783 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 242 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:55,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1707 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:40:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2022-07-11 23:40:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1000. [2022-07-11 23:40:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 912 states have (on average 1.2763157894736843) internal successors, (1164), 923 states have internal predecessors, (1164), 81 states have call successors, (81), 4 states have call predecessors, (81), 6 states have return successors, (84), 77 states have call predecessors, (84), 78 states have call successors, (84) [2022-07-11 23:40:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1329 transitions. [2022-07-11 23:40:55,832 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1329 transitions. Word has length 60 [2022-07-11 23:40:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:55,832 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 1329 transitions. [2022-07-11 23:40:55,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:40:55,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1329 transitions. [2022-07-11 23:40:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:40:55,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:55,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:55,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:56,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-11 23:40:56,047 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:56,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:56,048 INFO L85 PathProgramCache]: Analyzing trace with hash -339625375, now seen corresponding path program 1 times [2022-07-11 23:40:56,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:56,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796161534] [2022-07-11 23:40:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-11 23:40:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-11 23:40:56,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:56,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796161534] [2022-07-11 23:40:56,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796161534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:56,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:56,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:40:56,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122357557] [2022-07-11 23:40:56,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:56,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:40:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:56,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:40:56,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:40:56,088 INFO L87 Difference]: Start difference. First operand 1000 states and 1329 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:40:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:56,180 INFO L93 Difference]: Finished difference Result 1038 states and 1377 transitions. [2022-07-11 23:40:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:40:56,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-07-11 23:40:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:56,183 INFO L225 Difference]: With dead ends: 1038 [2022-07-11 23:40:56,183 INFO L226 Difference]: Without dead ends: 1034 [2022-07-11 23:40:56,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:40:56,184 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:56,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 820 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-07-11 23:40:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 995. [2022-07-11 23:40:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 906 states have (on average 1.2759381898454747) internal successors, (1156), 919 states have internal predecessors, (1156), 81 states have call successors, (81), 5 states have call predecessors, (81), 7 states have return successors, (84), 75 states have call predecessors, (84), 78 states have call successors, (84) [2022-07-11 23:40:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1321 transitions. [2022-07-11 23:40:56,222 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1321 transitions. Word has length 62 [2022-07-11 23:40:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:56,222 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1321 transitions. [2022-07-11 23:40:56,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:40:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1321 transitions. [2022-07-11 23:40:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:40:56,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:56,224 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:56,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:40:56,224 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash -282367073, now seen corresponding path program 1 times [2022-07-11 23:40:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:56,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5131810] [2022-07-11 23:40:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-11 23:40:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-11 23:40:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:56,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5131810] [2022-07-11 23:40:56,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5131810] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:56,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:56,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:40:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654288666] [2022-07-11 23:40:56,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:56,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:40:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:40:56,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:40:56,270 INFO L87 Difference]: Start difference. First operand 995 states and 1321 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:40:56,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:56,361 INFO L93 Difference]: Finished difference Result 1028 states and 1362 transitions. [2022-07-11 23:40:56,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:40:56,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2022-07-11 23:40:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:56,364 INFO L225 Difference]: With dead ends: 1028 [2022-07-11 23:40:56,364 INFO L226 Difference]: Without dead ends: 1014 [2022-07-11 23:40:56,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:40:56,365 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:56,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 820 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:40:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2022-07-11 23:40:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 980. [2022-07-11 23:40:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 894 states have (on average 1.2706935123042506) internal successors, (1136), 905 states have internal predecessors, (1136), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-11 23:40:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1294 transitions. [2022-07-11 23:40:56,396 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1294 transitions. Word has length 62 [2022-07-11 23:40:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:56,396 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1294 transitions. [2022-07-11 23:40:56,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:40:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1294 transitions. [2022-07-11 23:40:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:40:56,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:56,397 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:56,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:40:56,397 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1649289642, now seen corresponding path program 1 times [2022-07-11 23:40:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:56,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857024561] [2022-07-11 23:40:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-11 23:40:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:40:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:56,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857024561] [2022-07-11 23:40:56,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857024561] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:56,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671107744] [2022-07-11 23:40:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:56,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:56,498 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:56,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-11 23:40:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:56,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-11 23:40:56,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-11 23:40:56,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:40:56,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671107744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:56,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:40:56,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-11 23:40:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716780681] [2022-07-11 23:40:56,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:56,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:40:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:56,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:40:56,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:40:56,643 INFO L87 Difference]: Start difference. First operand 980 states and 1294 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:40:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:56,797 INFO L93 Difference]: Finished difference Result 1229 states and 1635 transitions. [2022-07-11 23:40:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:40:56,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-07-11 23:40:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:56,800 INFO L225 Difference]: With dead ends: 1229 [2022-07-11 23:40:56,800 INFO L226 Difference]: Without dead ends: 1213 [2022-07-11 23:40:56,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:40:56,801 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 218 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:56,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 527 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:40:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-07-11 23:40:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 980. [2022-07-11 23:40:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 894 states have (on average 1.2684563758389262) internal successors, (1134), 905 states have internal predecessors, (1134), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-11 23:40:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1292 transitions. [2022-07-11 23:40:56,836 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1292 transitions. Word has length 62 [2022-07-11 23:40:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:56,836 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 1292 transitions. [2022-07-11 23:40:56,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:40:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1292 transitions. [2022-07-11 23:40:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:40:56,837 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:56,837 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:56,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:57,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-11 23:40:57,051 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1828096048, now seen corresponding path program 1 times [2022-07-11 23:40:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:57,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853878445] [2022-07-11 23:40:57,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:57,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:57,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:40:57,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:57,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853878445] [2022-07-11 23:40:57,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853878445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:57,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:57,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:40:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233645750] [2022-07-11 23:40:57,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:57,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:40:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:57,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:40:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:40:57,102 INFO L87 Difference]: Start difference. First operand 980 states and 1292 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:57,294 INFO L93 Difference]: Finished difference Result 1643 states and 2220 transitions. [2022-07-11 23:40:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:40:57,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-07-11 23:40:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:57,297 INFO L225 Difference]: With dead ends: 1643 [2022-07-11 23:40:57,297 INFO L226 Difference]: Without dead ends: 1189 [2022-07-11 23:40:57,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:40:57,299 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 211 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:57,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1060 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:40:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2022-07-11 23:40:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1055. [2022-07-11 23:40:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 969 states have (on average 1.2445820433436532) internal successors, (1206), 980 states have internal predecessors, (1206), 78 states have call successors, (78), 5 states have call predecessors, (78), 7 states have return successors, (80), 74 states have call predecessors, (80), 74 states have call successors, (80) [2022-07-11 23:40:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1364 transitions. [2022-07-11 23:40:57,349 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1364 transitions. Word has length 62 [2022-07-11 23:40:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:57,349 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1364 transitions. [2022-07-11 23:40:57,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:40:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1364 transitions. [2022-07-11 23:40:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:40:57,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:57,350 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:57,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:40:57,350 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:57,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1826249006, now seen corresponding path program 1 times [2022-07-11 23:40:57,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:57,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051963403] [2022-07-11 23:40:57,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:57,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:57,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:57,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:57,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:40:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:40:57,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:57,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051963403] [2022-07-11 23:40:57,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051963403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:40:57,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:40:57,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-11 23:40:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579138608] [2022-07-11 23:40:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:40:57,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:40:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:57,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:40:57,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:40:57,492 INFO L87 Difference]: Start difference. First operand 1055 states and 1364 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:40:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:58,004 INFO L93 Difference]: Finished difference Result 1118 states and 1440 transitions. [2022-07-11 23:40:58,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:40:58,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2022-07-11 23:40:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:58,009 INFO L225 Difference]: With dead ends: 1118 [2022-07-11 23:40:58,009 INFO L226 Difference]: Without dead ends: 1116 [2022-07-11 23:40:58,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-11 23:40:58,010 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 380 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:58,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1998 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:40:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-07-11 23:40:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1065. [2022-07-11 23:40:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 977 states have (on average 1.2425793244626406) internal successors, (1214), 989 states have internal predecessors, (1214), 79 states have call successors, (79), 6 states have call predecessors, (79), 8 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2022-07-11 23:40:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1374 transitions. [2022-07-11 23:40:58,056 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1374 transitions. Word has length 62 [2022-07-11 23:40:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:58,056 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1374 transitions. [2022-07-11 23:40:58,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:40:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1374 transitions. [2022-07-11 23:40:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:40:58,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:58,058 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:58,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:40:58,059 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash -654456506, now seen corresponding path program 1 times [2022-07-11 23:40:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:58,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458884337] [2022-07-11 23:40:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:58,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:40:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:40:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:58,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458884337] [2022-07-11 23:40:58,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458884337] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:58,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131797367] [2022-07-11 23:40:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:58,132 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:58,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-11 23:40:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:40:58,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:40:58,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:40:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:40:58,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131797367] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:40:58,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:40:58,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-07-11 23:40:58,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225338295] [2022-07-11 23:40:58,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:40:58,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:40:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:58,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:40:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:40:58,300 INFO L87 Difference]: Start difference. First operand 1065 states and 1374 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:40:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:58,617 INFO L93 Difference]: Finished difference Result 3170 states and 4156 transitions. [2022-07-11 23:40:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:40:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-11 23:40:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:58,623 INFO L225 Difference]: With dead ends: 3170 [2022-07-11 23:40:58,624 INFO L226 Difference]: Without dead ends: 2732 [2022-07-11 23:40:58,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:40:58,625 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 286 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:58,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1824 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:40:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2022-07-11 23:40:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 1170. [2022-07-11 23:40:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1080 states have (on average 1.2361111111111112) internal successors, (1335), 1090 states have internal predecessors, (1335), 80 states have call successors, (80), 6 states have call predecessors, (80), 9 states have return successors, (88), 78 states have call predecessors, (88), 76 states have call successors, (88) [2022-07-11 23:40:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1503 transitions. [2022-07-11 23:40:58,684 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1503 transitions. Word has length 65 [2022-07-11 23:40:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:58,685 INFO L495 AbstractCegarLoop]: Abstraction has 1170 states and 1503 transitions. [2022-07-11 23:40:58,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:40:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1503 transitions. [2022-07-11 23:40:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:40:58,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:58,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:58,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-11 23:40:58,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:58,900 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:40:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:40:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1951567048, now seen corresponding path program 1 times [2022-07-11 23:40:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:40:58,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866082666] [2022-07-11 23:40:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:58,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:40:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:40:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:40:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:40:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:40:58,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:40:58,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866082666] [2022-07-11 23:40:58,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866082666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:40:58,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53668607] [2022-07-11 23:40:58,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:40:58,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:40:58,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:40:58,942 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:40:58,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-11 23:40:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:40:59,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-11 23:40:59,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:40:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:40:59,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:40:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:40:59,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53668607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:40:59,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:40:59,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-07-11 23:40:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106901120] [2022-07-11 23:40:59,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:40:59,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:40:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:40:59,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:40:59,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:40:59,198 INFO L87 Difference]: Start difference. First operand 1170 states and 1503 transitions. Second operand has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:40:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:40:59,862 INFO L93 Difference]: Finished difference Result 3318 states and 4373 transitions. [2022-07-11 23:40:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-11 23:40:59,862 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-11 23:40:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:40:59,883 INFO L225 Difference]: With dead ends: 3318 [2022-07-11 23:40:59,883 INFO L226 Difference]: Without dead ends: 2835 [2022-07-11 23:40:59,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-07-11 23:40:59,885 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 610 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:40:59,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 2300 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:40:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-07-11 23:40:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1230. [2022-07-11 23:40:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1138 states have (on average 1.2319859402460458) internal successors, (1402), 1146 states have internal predecessors, (1402), 81 states have call successors, (81), 6 states have call predecessors, (81), 10 states have return successors, (97), 82 states have call predecessors, (97), 77 states have call successors, (97) [2022-07-11 23:40:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1580 transitions. [2022-07-11 23:40:59,937 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1580 transitions. Word has length 65 [2022-07-11 23:40:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:40:59,938 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1580 transitions. [2022-07-11 23:40:59,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.222222222222222) internal successors, (76), 16 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:40:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1580 transitions. [2022-07-11 23:40:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:40:59,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:40:59,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:40:59,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-11 23:41:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-11 23:41:00,156 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:00,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -520443000, now seen corresponding path program 1 times [2022-07-11 23:41:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:00,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012578484] [2022-07-11 23:41:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:00,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:00,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:41:00,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:00,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012578484] [2022-07-11 23:41:00,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012578484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:00,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280384688] [2022-07-11 23:41:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:00,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:00,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:00,240 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:41:00,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-11 23:41:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:00,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-11 23:41:00,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:41:00,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:41:00,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280384688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:00,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:00,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-07-11 23:41:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77152125] [2022-07-11 23:41:00,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:00,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:41:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:41:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:41:00,399 INFO L87 Difference]: Start difference. First operand 1230 states and 1580 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:00,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:00,814 INFO L93 Difference]: Finished difference Result 3599 states and 4859 transitions. [2022-07-11 23:41:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:41:00,814 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-11 23:41:00,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:00,838 INFO L225 Difference]: With dead ends: 3599 [2022-07-11 23:41:00,838 INFO L226 Difference]: Without dead ends: 3274 [2022-07-11 23:41:00,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:41:00,840 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 491 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:00,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 2439 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:41:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2022-07-11 23:41:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 1356. [2022-07-11 23:41:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1264 states have (on average 1.2231012658227849) internal successors, (1546), 1272 states have internal predecessors, (1546), 81 states have call successors, (81), 6 states have call predecessors, (81), 10 states have return successors, (97), 82 states have call predecessors, (97), 77 states have call successors, (97) [2022-07-11 23:41:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1724 transitions. [2022-07-11 23:41:00,899 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1724 transitions. Word has length 65 [2022-07-11 23:41:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:00,899 INFO L495 AbstractCegarLoop]: Abstraction has 1356 states and 1724 transitions. [2022-07-11 23:41:00,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1724 transitions. [2022-07-11 23:41:00,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:41:00,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:00,901 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:00,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:41:01,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-11 23:41:01,114 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash -915317052, now seen corresponding path program 1 times [2022-07-11 23:41:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:01,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832399711] [2022-07-11 23:41:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:01,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:41:01,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:01,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832399711] [2022-07-11 23:41:01,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832399711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:01,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200561406] [2022-07-11 23:41:01,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:01,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:01,199 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:41:01,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-11 23:41:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:01,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-11 23:41:01,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:41:01,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 23:41:01,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200561406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:01,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:41:01,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-11 23:41:01,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821217840] [2022-07-11 23:41:01,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:01,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:41:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:01,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:41:01,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:41:01,522 INFO L87 Difference]: Start difference. First operand 1356 states and 1724 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:41:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:02,638 INFO L93 Difference]: Finished difference Result 4186 states and 5617 transitions. [2022-07-11 23:41:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-11 23:41:02,639 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-11 23:41:02,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:02,645 INFO L225 Difference]: With dead ends: 4186 [2022-07-11 23:41:02,645 INFO L226 Difference]: Without dead ends: 3598 [2022-07-11 23:41:02,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1522, Unknown=0, NotChecked=0, Total=1806 [2022-07-11 23:41:02,664 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 948 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:02,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 2562 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:41:02,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2022-07-11 23:41:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 1272. [2022-07-11 23:41:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1181 states have (on average 1.2277730736663843) internal successors, (1450), 1192 states have internal predecessors, (1450), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 78 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-11 23:41:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1621 transitions. [2022-07-11 23:41:02,720 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1621 transitions. Word has length 65 [2022-07-11 23:41:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:02,721 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1621 transitions. [2022-07-11 23:41:02,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 4 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:41:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1621 transitions. [2022-07-11 23:41:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:41:02,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:02,722 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:02,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-11 23:41:02,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-11 23:41:02,936 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:02,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1548806121, now seen corresponding path program 1 times [2022-07-11 23:41:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:02,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757975095] [2022-07-11 23:41:02,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:02,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:02,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:02,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:41:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 23:41:02,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:02,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757975095] [2022-07-11 23:41:02,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757975095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:02,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223215907] [2022-07-11 23:41:02,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:02,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:02,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:03,000 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:41:03,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-11 23:41:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 23:41:03,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:41:03,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:03,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223215907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:03,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:41:03,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-11 23:41:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839340647] [2022-07-11 23:41:03,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:03,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:03,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:03,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:41:03,070 INFO L87 Difference]: Start difference. First operand 1272 states and 1621 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:03,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:03,162 INFO L93 Difference]: Finished difference Result 2435 states and 3135 transitions. [2022-07-11 23:41:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:41:03,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-11 23:41:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:03,164 INFO L225 Difference]: With dead ends: 2435 [2022-07-11 23:41:03,164 INFO L226 Difference]: Without dead ends: 1306 [2022-07-11 23:41:03,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:41:03,166 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 27 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:03,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 385 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-07-11 23:41:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1281. [2022-07-11 23:41:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1190 states have (on average 1.2285714285714286) internal successors, (1462), 1201 states have internal predecessors, (1462), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 78 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-11 23:41:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1633 transitions. [2022-07-11 23:41:03,215 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1633 transitions. Word has length 65 [2022-07-11 23:41:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:03,215 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1633 transitions. [2022-07-11 23:41:03,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1633 transitions. [2022-07-11 23:41:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:41:03,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:03,217 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:03,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-11 23:41:03,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:03,432 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:03,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:03,433 INFO L85 PathProgramCache]: Analyzing trace with hash -267248656, now seen corresponding path program 2 times [2022-07-11 23:41:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:03,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884225486] [2022-07-11 23:41:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:41:03,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:03,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884225486] [2022-07-11 23:41:03,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884225486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:03,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:03,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:41:03,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177487516] [2022-07-11 23:41:03,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:03,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:41:03,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:03,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:41:03,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:41:03,483 INFO L87 Difference]: Start difference. First operand 1281 states and 1633 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:03,805 INFO L93 Difference]: Finished difference Result 2456 states and 3239 transitions. [2022-07-11 23:41:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:41:03,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-07-11 23:41:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:03,809 INFO L225 Difference]: With dead ends: 2456 [2022-07-11 23:41:03,809 INFO L226 Difference]: Without dead ends: 2247 [2022-07-11 23:41:03,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:41:03,810 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 319 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:03,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1798 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:41:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2022-07-11 23:41:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 1434. [2022-07-11 23:41:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1343 states have (on average 1.2204020848845867) internal successors, (1639), 1351 states have internal predecessors, (1639), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (91), 81 states have call predecessors, (91), 76 states have call successors, (91) [2022-07-11 23:41:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1810 transitions. [2022-07-11 23:41:03,863 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1810 transitions. Word has length 65 [2022-07-11 23:41:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:03,863 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1810 transitions. [2022-07-11 23:41:03,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1810 transitions. [2022-07-11 23:41:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:41:03,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:03,865 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:03,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-11 23:41:03,865 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash -662122708, now seen corresponding path program 1 times [2022-07-11 23:41:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:03,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246652342] [2022-07-11 23:41:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:41:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:41:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:03,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246652342] [2022-07-11 23:41:03,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246652342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:03,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:03,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:41:03,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420461401] [2022-07-11 23:41:03,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:03,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:41:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:03,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:41:03,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:41:03,908 INFO L87 Difference]: Start difference. First operand 1434 states and 1810 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:04,225 INFO L93 Difference]: Finished difference Result 2768 states and 3629 transitions. [2022-07-11 23:41:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:41:04,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2022-07-11 23:41:04,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:04,228 INFO L225 Difference]: With dead ends: 2768 [2022-07-11 23:41:04,228 INFO L226 Difference]: Without dead ends: 2306 [2022-07-11 23:41:04,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:41:04,230 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 312 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:04,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 942 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:41:04,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2022-07-11 23:41:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1432. [2022-07-11 23:41:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1341 states have (on average 1.2192393736017897) internal successors, (1635), 1347 states have internal predecessors, (1635), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (90), 83 states have call predecessors, (90), 76 states have call successors, (90) [2022-07-11 23:41:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1805 transitions. [2022-07-11 23:41:04,283 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1805 transitions. Word has length 65 [2022-07-11 23:41:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:04,284 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 1805 transitions. [2022-07-11 23:41:04,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1805 transitions. [2022-07-11 23:41:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-11 23:41:04,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:04,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:04,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-11 23:41:04,286 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:04,286 INFO L85 PathProgramCache]: Analyzing trace with hash -560142362, now seen corresponding path program 1 times [2022-07-11 23:41:04,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:04,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031912074] [2022-07-11 23:41:04,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:04,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:41:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:41:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:41:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 23:41:04,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:41:04,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031912074] [2022-07-11 23:41:04,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031912074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654176655] [2022-07-11 23:41:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:04,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:41:04,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:04,320 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:41:04,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-11 23:41:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:04,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:41:04,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:41:04,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:04,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654176655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:04,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:41:04,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-11 23:41:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195479403] [2022-07-11 23:41:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:04,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:04,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:41:04,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:04,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:41:04,375 INFO L87 Difference]: Start difference. First operand 1432 states and 1805 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:04,465 INFO L93 Difference]: Finished difference Result 2428 states and 3070 transitions. [2022-07-11 23:41:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:41:04,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-07-11 23:41:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:04,468 INFO L225 Difference]: With dead ends: 2428 [2022-07-11 23:41:04,468 INFO L226 Difference]: Without dead ends: 1443 [2022-07-11 23:41:04,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:41:04,469 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 14 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:04,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 410 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2022-07-11 23:41:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1433. [2022-07-11 23:41:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1342 states have (on average 1.2198211624441133) internal successors, (1637), 1348 states have internal predecessors, (1637), 80 states have call successors, (80), 6 states have call predecessors, (80), 10 states have return successors, (90), 83 states have call predecessors, (90), 76 states have call successors, (90) [2022-07-11 23:41:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1807 transitions. [2022-07-11 23:41:04,530 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1807 transitions. Word has length 66 [2022-07-11 23:41:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:04,530 INFO L495 AbstractCegarLoop]: Abstraction has 1433 states and 1807 transitions. [2022-07-11 23:41:04,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1807 transitions. [2022-07-11 23:41:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-11 23:41:04,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:04,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:04,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-11 23:41:04,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-11 23:41:04,749 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:04,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1378433375, now seen corresponding path program 1 times [2022-07-11 23:41:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:41:04,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599326353] [2022-07-11 23:41:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:41:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:41:04,767 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:41:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:41:04,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-11 23:41:04,802 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:41:04,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:41:04,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-11 23:41:04,806 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:04,809 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:41:04,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:41:04 BoogieIcfgContainer [2022-07-11 23:41:04,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:41:04,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:41:04,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:41:04,871 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:41:04,872 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:40:46" (3/4) ... [2022-07-11 23:41:04,873 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-11 23:41:04,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:41:04,874 INFO L158 Benchmark]: Toolchain (without parser) took 19599.34ms. Allocated memory was 134.2MB in the beginning and 408.9MB in the end (delta: 274.7MB). Free memory was 97.6MB in the beginning and 264.6MB in the end (delta: -167.0MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB. [2022-07-11 23:41:04,874 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory was 106.5MB in the beginning and 106.5MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:41:04,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.01ms. Allocated memory is still 134.2MB. Free memory was 97.6MB in the beginning and 104.2MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:41:04,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.27ms. Allocated memory is still 134.2MB. Free memory was 104.2MB in the beginning and 101.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:41:04,875 INFO L158 Benchmark]: Boogie Preprocessor took 35.57ms. Allocated memory is still 134.2MB. Free memory was 101.8MB in the beginning and 100.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:41:04,875 INFO L158 Benchmark]: RCFGBuilder took 470.37ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 80.0MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-11 23:41:04,875 INFO L158 Benchmark]: TraceAbstraction took 18763.65ms. Allocated memory was 134.2MB in the beginning and 408.9MB in the end (delta: 274.7MB). Free memory was 79.2MB in the beginning and 265.7MB in the end (delta: -186.5MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. [2022-07-11 23:41:04,875 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 408.9MB. Free memory was 265.7MB in the beginning and 264.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:41:04,876 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.17ms. Allocated memory is still 134.2MB. Free memory was 106.5MB in the beginning and 106.5MB in the end (delta: 29.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.01ms. Allocated memory is still 134.2MB. Free memory was 97.6MB in the beginning and 104.2MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.27ms. Allocated memory is still 134.2MB. Free memory was 104.2MB in the beginning and 101.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.57ms. Allocated memory is still 134.2MB. Free memory was 101.8MB in the beginning and 100.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.37ms. Allocated memory is still 134.2MB. Free memory was 100.1MB in the beginning and 80.0MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18763.65ms. Allocated memory was 134.2MB in the beginning and 408.9MB in the end (delta: 274.7MB). Free memory was 79.2MB in the beginning and 265.7MB in the end (delta: -186.5MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 408.9MB. Free memory was 265.7MB in the beginning and 264.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-125, eb=127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L80] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=0, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L29] COND FALSE !(! m) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L57] COND TRUE 1 VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=16777216, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=144115188075855873] [L77] res = m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L78] __retres4 = res VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=-125, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=16777216, \old(res = m | ((unsigned int )(e + 128) << 24U))=144115188075855873, \result=144115188075855871, __retres4=4294967295, e=-125, m=0, m = m & ~ (1U << 24U)=144115188075855872, res=4294967295, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=144115188075855871, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L80] return (__retres4); VAL [\old(e)=127, \old(m = m & ~ (1U << 24U))=144115188075855872, \old(m)=33554432, \old(res = m | ((unsigned int )(e + 128) << 24U))=50331648, \result=4294967295, __retres4=4294967295, e=127, m=33554432, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L253] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, tmp=1, zero=0] [L263] sa = tmp VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=-125, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=16777216, mb=33554432, res = m | ((unsigned int )(e + 128) << 24U)=50331648, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L101] COND FALSE !(! b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L108] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, m = m & ~ (1U << 24U)=144115188075855872, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=4294967295, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L110] ma = ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L111] mb = b & ((1U << 24U) - 1U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=4294967295, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L113] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=-129, eb=127, m = m & ~ (1U << 24U)=144115188075855872, ma=3, ma = a & ((1U << 24U) - 1U)=16777215, mb=2, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L17] reach_error() VAL [\old(cond)=0, cond=0, m = m & ~ (1U << 24U)=144115188075855872, ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8057 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7863 mSDsluCounter, 42220 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35138 mSDsCounter, 955 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9268 IncrementalHoareTripleChecker+Invalid, 10223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 955 mSolverCounterUnsat, 7082 mSDtfsCounter, 9268 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2105 GetRequests, 1621 SyntacticMatches, 15 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1434occurred in iteration=35, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 12764 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2922 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 3364 ConstructedInterpolants, 0 QuantifiedInterpolants, 9323 SizeOfPredicates, 88 NumberOfNonLiveVariables, 2664 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 62 InterpolantComputations, 29 PerfectInterpolantSequences, 916/1054 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-11 23:41:04,893 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/bitvector/soft_float_1-3a.c.cil.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:41:06,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:41:06,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:41:06,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:41:06,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:41:06,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:41:06,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:41:06,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:41:06,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:41:06,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:41:06,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:41:06,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:41:06,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:41:06,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:41:06,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:41:06,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:41:06,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:41:06,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:41:06,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:41:06,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:41:06,710 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:41:06,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:41:06,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:41:06,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:41:06,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:41:06,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:41:06,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:41:06,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:41:06,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:41:06,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:41:06,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:41:06,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:41:06,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:41:06,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:41:06,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:41:06,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:41:06,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:41:06,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:41:06,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:41:06,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:41:06,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:41:06,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:41:06,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-11 23:41:06,762 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:41:06,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:41:06,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:41:06,763 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:41:06,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:41:06,763 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:41:06,764 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:41:06,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:41:06,764 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:41:06,765 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:41:06,765 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:41:06,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:41:06,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:41:06,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:41:06,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:41:06,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:41:06,766 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-11 23:41:06,766 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-11 23:41:06,766 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-11 23:41:06,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:41:06,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:41:06,767 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:41:06,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:41:06,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:41:06,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:41:06,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:41:06,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:41:06,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:41:06,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:41:06,768 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:41:06,768 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-11 23:41:06,768 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-11 23:41:06,768 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:41:06,769 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:41:06,769 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:41:06,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-11 23:41:06,769 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2022-07-11 23:41:07,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:41:07,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:41:07,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:41:07,053 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:41:07,053 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:41:07,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-11 23:41:07,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47936042e/428243eeeb4f49b1a48ca1d4b1465856/FLAG8ca8bba26 [2022-07-11 23:41:07,609 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:41:07,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2022-07-11 23:41:07,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47936042e/428243eeeb4f49b1a48ca1d4b1465856/FLAG8ca8bba26 [2022-07-11 23:41:08,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47936042e/428243eeeb4f49b1a48ca1d4b1465856 [2022-07-11 23:41:08,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:41:08,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:41:08,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:41:08,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:41:08,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:41:08,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a15196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08, skipping insertion in model container [2022-07-11 23:41:08,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:41:08,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:41:08,233 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-11 23:41:08,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:41:08,307 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:41:08,316 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/bitvector/soft_float_1-3a.c.cil.c[730,743] [2022-07-11 23:41:08,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:41:08,363 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:41:08,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08 WrapperNode [2022-07-11 23:41:08,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:41:08,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:41:08,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:41:08,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:41:08,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,402 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 145 [2022-07-11 23:41:08,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:41:08,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:41:08,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:41:08,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:41:08,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:41:08,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:41:08,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:41:08,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:41:08,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (1/1) ... [2022-07-11 23:41:08,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:41:08,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:41:08,476 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-11 23:41:08,539 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-11 23:41:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:41:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:41:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-11 23:41:08,585 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-11 23:41:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:41:08,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:41:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-11 23:41:08,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-11 23:41:08,656 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:41:08,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:41:08,923 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:41:08,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:41:08,931 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-11 23:41:08,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:41:08 BoogieIcfgContainer [2022-07-11 23:41:08,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:41:08,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:41:08,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:41:08,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:41:08,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:41:08" (1/3) ... [2022-07-11 23:41:08,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6860355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:41:08, skipping insertion in model container [2022-07-11 23:41:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:41:08" (2/3) ... [2022-07-11 23:41:08,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6860355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:41:08, skipping insertion in model container [2022-07-11 23:41:08,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:41:08" (3/3) ... [2022-07-11 23:41:08,938 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2022-07-11 23:41:08,946 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:41:08,947 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:41:08,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:41:08,983 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@4a74f208, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ec37061 [2022-07-11 23:41:08,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:41:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-11 23:41:08,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:41:08,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:08,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:08,992 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1607439287, now seen corresponding path program 1 times [2022-07-11 23:41:09,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:09,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950098514] [2022-07-11 23:41:09,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:09,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:09,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:09,006 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-11 23:41:09,007 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-11 23:41:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:09,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:41:09,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:41:09,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:41:09,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:09,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950098514] [2022-07-11 23:41:09,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950098514] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:09,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:41:09,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-11 23:41:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789504944] [2022-07-11 23:41:09,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:09,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:41:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:41:09,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:41:09,209 INFO L87 Difference]: Start difference. First operand has 72 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 62 states have internal predecessors, (94), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:09,319 INFO L93 Difference]: Finished difference Result 194 states and 324 transitions. [2022-07-11 23:41:09,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:41:09,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-07-11 23:41:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:09,327 INFO L225 Difference]: With dead ends: 194 [2022-07-11 23:41:09,327 INFO L226 Difference]: Without dead ends: 117 [2022-07-11 23:41:09,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:41:09,332 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 61 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:09,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 738 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:41:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-11 23:41:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 80. [2022-07-11 23:41:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 67 states have internal predecessors, (95), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2022-07-11 23:41:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2022-07-11 23:41:09,363 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 32 [2022-07-11 23:41:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:09,364 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2022-07-11 23:41:09,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2022-07-11 23:41:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:41:09,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:09,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:09,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:41:09,573 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-11 23:41:09,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:09,574 INFO L85 PathProgramCache]: Analyzing trace with hash 861184615, now seen corresponding path program 1 times [2022-07-11 23:41:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:09,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905241974] [2022-07-11 23:41:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:09,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:09,579 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-11 23:41:09,580 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-11 23:41:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:09,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:41:09,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:41:09,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:09,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:09,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905241974] [2022-07-11 23:41:09,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905241974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:09,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:09,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:41:09,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436702508] [2022-07-11 23:41:09,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:09,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:41:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:09,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:41:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:41:09,658 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:09,740 INFO L93 Difference]: Finished difference Result 169 states and 260 transitions. [2022-07-11 23:41:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:41:09,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-11 23:41:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:09,742 INFO L225 Difference]: With dead ends: 169 [2022-07-11 23:41:09,742 INFO L226 Difference]: Without dead ends: 127 [2022-07-11 23:41:09,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:41:09,743 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 52 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:09,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 457 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:41:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-11 23:41:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2022-07-11 23:41:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4660194174757282) internal successors, (151), 104 states have internal predecessors, (151), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (20), 18 states have call predecessors, (20), 15 states have call successors, (20) [2022-07-11 23:41:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 187 transitions. [2022-07-11 23:41:09,764 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 187 transitions. Word has length 36 [2022-07-11 23:41:09,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:09,765 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 187 transitions. [2022-07-11 23:41:09,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 187 transitions. [2022-07-11 23:41:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:41:09,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:09,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:09,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-11 23:41:09,972 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-11 23:41:09,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:09,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1541242985, now seen corresponding path program 1 times [2022-07-11 23:41:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:09,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695372330] [2022-07-11 23:41:09,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:09,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:09,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:09,976 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-11 23:41:09,978 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-11 23:41:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:41:10,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:41:10,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:10,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:10,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695372330] [2022-07-11 23:41:10,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695372330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:10,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:10,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:41:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876683426] [2022-07-11 23:41:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:10,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:41:10,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:10,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:41:10,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:41:10,053 INFO L87 Difference]: Start difference. First operand 123 states and 187 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:10,140 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2022-07-11 23:41:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:41:10,141 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-07-11 23:41:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:10,142 INFO L225 Difference]: With dead ends: 180 [2022-07-11 23:41:10,142 INFO L226 Difference]: Without dead ends: 141 [2022-07-11 23:41:10,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:41:10,143 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:10,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 539 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:41:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-11 23:41:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 114. [2022-07-11 23:41:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.443298969072165) internal successors, (140), 98 states have internal predecessors, (140), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2022-07-11 23:41:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2022-07-11 23:41:10,153 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 36 [2022-07-11 23:41:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:10,153 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2022-07-11 23:41:10,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2022-07-11 23:41:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 23:41:10,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:10,157 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:10,166 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-11 23:41:10,364 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-11 23:41:10,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:10,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:10,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1860643154, now seen corresponding path program 1 times [2022-07-11 23:41:10,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:10,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549260891] [2022-07-11 23:41:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:10,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:10,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:10,367 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-11 23:41:10,368 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-11 23:41:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:41:10,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:41:10,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:41:10,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:10,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549260891] [2022-07-11 23:41:10,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549260891] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:10,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:41:10,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-11 23:41:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073381022] [2022-07-11 23:41:10,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:10,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:41:10,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:10,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:41:10,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:41:10,517 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:10,643 INFO L93 Difference]: Finished difference Result 312 states and 476 transitions. [2022-07-11 23:41:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:41:10,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2022-07-11 23:41:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:10,645 INFO L225 Difference]: With dead ends: 312 [2022-07-11 23:41:10,645 INFO L226 Difference]: Without dead ends: 237 [2022-07-11 23:41:10,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:41:10,647 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 197 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:10,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 645 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:41:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-11 23:41:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 178. [2022-07-11 23:41:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 154 states have internal predecessors, (215), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (25), 25 states have call predecessors, (25), 18 states have call successors, (25) [2022-07-11 23:41:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2022-07-11 23:41:10,669 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 40 [2022-07-11 23:41:10,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:10,670 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2022-07-11 23:41:10,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2022-07-11 23:41:10,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:41:10,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:10,675 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:10,697 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-11 23:41:10,911 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-11 23:41:10,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash 339137576, now seen corresponding path program 1 times [2022-07-11 23:41:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:10,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098954578] [2022-07-11 23:41:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:10,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:10,914 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-11 23:41:10,915 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-11 23:41:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:10,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:41:10,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:41:11,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:11,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:11,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098954578] [2022-07-11 23:41:11,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098954578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:11,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:11,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:41:11,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478601124] [2022-07-11 23:41:11,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:11,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:11,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:11,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:11,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:41:11,077 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:11,112 INFO L93 Difference]: Finished difference Result 331 states and 489 transitions. [2022-07-11 23:41:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:41:11,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-07-11 23:41:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:11,114 INFO L225 Difference]: With dead ends: 331 [2022-07-11 23:41:11,114 INFO L226 Difference]: Without dead ends: 265 [2022-07-11 23:41:11,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:41:11,115 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 66 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:11,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 344 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-11 23:41:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 233. [2022-07-11 23:41:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 206 states have internal predecessors, (279), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2022-07-11 23:41:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 329 transitions. [2022-07-11 23:41:11,127 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 329 transitions. Word has length 43 [2022-07-11 23:41:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:11,127 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 329 transitions. [2022-07-11 23:41:11,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 329 transitions. [2022-07-11 23:41:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:41:11,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:11,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:11,137 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-11 23:41:11,335 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-11 23:41:11,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1682069059, now seen corresponding path program 1 times [2022-07-11 23:41:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:11,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021145040] [2022-07-11 23:41:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:11,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:11,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:11,338 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-11 23:41:11,339 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-11 23:41:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:41:11,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-11 23:41:11,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:11,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:11,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021145040] [2022-07-11 23:41:11,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021145040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:11,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:11,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:41:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598998072] [2022-07-11 23:41:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:11,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:11,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:41:11,424 INFO L87 Difference]: Start difference. First operand 233 states and 329 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:11,464 INFO L93 Difference]: Finished difference Result 408 states and 573 transitions. [2022-07-11 23:41:11,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:41:11,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-07-11 23:41:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:11,467 INFO L225 Difference]: With dead ends: 408 [2022-07-11 23:41:11,467 INFO L226 Difference]: Without dead ends: 178 [2022-07-11 23:41:11,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:41:11,471 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 25 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:11,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 250 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-11 23:41:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-07-11 23:41:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 148 states have internal predecessors, (191), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-11 23:41:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2022-07-11 23:41:11,493 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 43 [2022-07-11 23:41:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:11,494 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2022-07-11 23:41:11,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 23:41:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2022-07-11 23:41:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:41:11,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:11,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:11,505 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-11 23:41:11,705 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-11 23:41:11,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:11,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:11,706 INFO L85 PathProgramCache]: Analyzing trace with hash -690232792, now seen corresponding path program 1 times [2022-07-11 23:41:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:11,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508562669] [2022-07-11 23:41:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:11,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:11,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:11,708 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-11 23:41:11,709 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-11 23:41:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:11,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:41:11,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:41:11,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:41:11,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:11,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508562669] [2022-07-11 23:41:11,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508562669] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:11,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:41:11,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-11 23:41:11,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812244268] [2022-07-11 23:41:11,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:11,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:41:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:41:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:41:11,958 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:12,239 INFO L93 Difference]: Finished difference Result 316 states and 459 transitions. [2022-07-11 23:41:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:41:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-11 23:41:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:12,241 INFO L225 Difference]: With dead ends: 316 [2022-07-11 23:41:12,241 INFO L226 Difference]: Without dead ends: 280 [2022-07-11 23:41:12,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:41:12,241 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 193 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:12,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 502 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:41:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-07-11 23:41:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 204. [2022-07-11 23:41:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.303370786516854) internal successors, (232), 181 states have internal predecessors, (232), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-11 23:41:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2022-07-11 23:41:12,250 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 44 [2022-07-11 23:41:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:12,250 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2022-07-11 23:41:12,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2022-07-11 23:41:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:41:12,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:12,251 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:12,265 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-11 23:41:12,457 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-11 23:41:12,458 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1084774570, now seen corresponding path program 1 times [2022-07-11 23:41:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:12,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403287674] [2022-07-11 23:41:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:12,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:12,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:12,460 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-11 23:41:12,462 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-11 23:41:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:12,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 23:41:12,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:41:12,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:12,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:12,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403287674] [2022-07-11 23:41:12,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403287674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:12,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:12,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:41:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265158064] [2022-07-11 23:41:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:12,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:41:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:12,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:41:12,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:41:12,515 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:12,537 INFO L93 Difference]: Finished difference Result 211 states and 285 transitions. [2022-07-11 23:41:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:41:12,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-11 23:41:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:12,539 INFO L225 Difference]: With dead ends: 211 [2022-07-11 23:41:12,539 INFO L226 Difference]: Without dead ends: 204 [2022-07-11 23:41:12,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:41:12,540 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 5 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:12,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 380 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-11 23:41:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-07-11 23:41:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 178 states have (on average 1.2865168539325842) internal successors, (229), 181 states have internal predecessors, (229), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-11 23:41:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 276 transitions. [2022-07-11 23:41:12,548 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 276 transitions. Word has length 44 [2022-07-11 23:41:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:12,548 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 276 transitions. [2022-07-11 23:41:12,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2022-07-11 23:41:12,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:41:12,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:12,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:12,557 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-11 23:41:12,757 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-11 23:41:12,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:12,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1077808761, now seen corresponding path program 2 times [2022-07-11 23:41:12,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:12,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088171680] [2022-07-11 23:41:12,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:41:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:12,760 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-11 23:41:12,766 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-11 23:41:12,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-11 23:41:12,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:41:12,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:41:12,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-11 23:41:12,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:12,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:12,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088171680] [2022-07-11 23:41:12,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088171680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:12,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:12,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:41:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488311106] [2022-07-11 23:41:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:12,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:41:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:41:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:41:12,909 INFO L87 Difference]: Start difference. First operand 204 states and 276 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:12,960 INFO L93 Difference]: Finished difference Result 247 states and 337 transitions. [2022-07-11 23:41:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:41:12,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-11 23:41:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:12,962 INFO L225 Difference]: With dead ends: 247 [2022-07-11 23:41:12,962 INFO L226 Difference]: Without dead ends: 245 [2022-07-11 23:41:12,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:41:12,964 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 38 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:12,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 597 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-11 23:41:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-11 23:41:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 208. [2022-07-11 23:41:12,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.281767955801105) internal successors, (232), 184 states have internal predecessors, (232), 21 states have call successors, (21), 3 states have call predecessors, (21), 5 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-11 23:41:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 279 transitions. [2022-07-11 23:41:12,976 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 279 transitions. Word has length 44 [2022-07-11 23:41:12,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:12,976 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 279 transitions. [2022-07-11 23:41:12,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 279 transitions. [2022-07-11 23:41:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:41:12,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:12,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:12,997 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-11 23:41:13,183 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-11 23:41:13,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1020550459, now seen corresponding path program 1 times [2022-07-11 23:41:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:13,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828464519] [2022-07-11 23:41:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:13,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:13,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:13,187 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-11 23:41:13,189 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-11 23:41:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:13,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-11 23:41:13,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:41:13,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-11 23:41:13,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828464519] [2022-07-11 23:41:13,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828464519] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:41:13,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:41:13,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2022-07-11 23:41:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683799571] [2022-07-11 23:41:13,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:13,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:41:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:13,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:41:13,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:41:13,484 INFO L87 Difference]: Start difference. First operand 208 states and 279 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:13,625 INFO L93 Difference]: Finished difference Result 265 states and 359 transitions. [2022-07-11 23:41:13,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:41:13,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-11 23:41:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:13,627 INFO L225 Difference]: With dead ends: 265 [2022-07-11 23:41:13,627 INFO L226 Difference]: Without dead ends: 263 [2022-07-11 23:41:13,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:41:13,628 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 84 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:13,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 508 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:41:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-11 23:41:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 212. [2022-07-11 23:41:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 187 states have internal predecessors, (235), 21 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2022-07-11 23:41:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 282 transitions. [2022-07-11 23:41:13,646 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 282 transitions. Word has length 44 [2022-07-11 23:41:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:13,647 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 282 transitions. [2022-07-11 23:41:13,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 282 transitions. [2022-07-11 23:41:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:41:13,648 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:13,648 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:13,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-11 23:41:13,854 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-11 23:41:13,854 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:13,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1134786859, now seen corresponding path program 1 times [2022-07-11 23:41:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:13,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66899072] [2022-07-11 23:41:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:13,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:13,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:13,857 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-11 23:41:13,859 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-11 23:41:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:13,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:41:13,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:41:13,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:13,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:13,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66899072] [2022-07-11 23:41:13,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66899072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:13,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:13,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:41:13,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755212035] [2022-07-11 23:41:13,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:13,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:13,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:13,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:41:13,908 INFO L87 Difference]: Start difference. First operand 212 states and 282 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:13,935 INFO L93 Difference]: Finished difference Result 351 states and 481 transitions. [2022-07-11 23:41:13,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:41:13,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-11 23:41:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:13,937 INFO L225 Difference]: With dead ends: 351 [2022-07-11 23:41:13,937 INFO L226 Difference]: Without dead ends: 299 [2022-07-11 23:41:13,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:41:13,938 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 75 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:13,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 309 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-11 23:41:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 231. [2022-07-11 23:41:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 200 states have (on average 1.285) internal successors, (257), 202 states have internal predecessors, (257), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2022-07-11 23:41:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 310 transitions. [2022-07-11 23:41:13,950 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 310 transitions. Word has length 45 [2022-07-11 23:41:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:13,950 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 310 transitions. [2022-07-11 23:41:13,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:13,951 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 310 transitions. [2022-07-11 23:41:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:41:13,951 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:13,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:13,983 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-11 23:41:14,158 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-11 23:41:14,158 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:14,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash 702695573, now seen corresponding path program 1 times [2022-07-11 23:41:14,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:14,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391863994] [2022-07-11 23:41:14,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:14,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:14,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:14,160 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-11 23:41:14,161 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-11 23:41:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:14,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 23:41:14,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:41:14,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:14,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:14,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391863994] [2022-07-11 23:41:14,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391863994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:14,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:14,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:41:14,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061367708] [2022-07-11 23:41:14,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:14,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:41:14,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:14,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:41:14,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:41:14,226 INFO L87 Difference]: Start difference. First operand 231 states and 310 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:14,262 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2022-07-11 23:41:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:41:14,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2022-07-11 23:41:14,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:14,264 INFO L225 Difference]: With dead ends: 246 [2022-07-11 23:41:14,264 INFO L226 Difference]: Without dead ends: 207 [2022-07-11 23:41:14,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:41:14,265 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:14,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 285 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-11 23:41:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-11 23:41:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 179 states have internal predecessors, (229), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2022-07-11 23:41:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 280 transitions. [2022-07-11 23:41:14,277 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 280 transitions. Word has length 48 [2022-07-11 23:41:14,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:14,277 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 280 transitions. [2022-07-11 23:41:14,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 280 transitions. [2022-07-11 23:41:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:41:14,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:14,278 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:14,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-11 23:41:14,484 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-11 23:41:14,485 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1948634931, now seen corresponding path program 1 times [2022-07-11 23:41:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:14,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256303831] [2022-07-11 23:41:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:14,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:14,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:14,490 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:41:14,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-11 23:41:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:14,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:41:14,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 23:41:14,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:41:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 23:41:14,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:14,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256303831] [2022-07-11 23:41:14,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256303831] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:41:14,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:41:14,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2022-07-11 23:41:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837473326] [2022-07-11 23:41:14,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:41:14,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:41:14,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:41:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:41:14,669 INFO L87 Difference]: Start difference. First operand 207 states and 280 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-11 23:41:14,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:14,790 INFO L93 Difference]: Finished difference Result 298 states and 396 transitions. [2022-07-11 23:41:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:41:14,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-07-11 23:41:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:14,791 INFO L225 Difference]: With dead ends: 298 [2022-07-11 23:41:14,791 INFO L226 Difference]: Without dead ends: 232 [2022-07-11 23:41:14,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:41:14,792 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 174 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:14,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 634 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:41:14,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-11 23:41:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 166. [2022-07-11 23:41:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 143 states have internal predecessors, (184), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2022-07-11 23:41:14,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2022-07-11 23:41:14,811 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 50 [2022-07-11 23:41:14,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:14,811 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2022-07-11 23:41:14,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-11 23:41:14,811 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2022-07-11 23:41:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 23:41:14,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:14,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:14,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-11 23:41:15,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:41:15,019 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:15,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1060673824, now seen corresponding path program 1 times [2022-07-11 23:41:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:15,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280593887] [2022-07-11 23:41:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:15,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:15,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:15,023 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:41:15,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-11 23:41:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:41:15,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:41:15,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:41:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-11 23:41:15,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:41:15,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:41:15,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280593887] [2022-07-11 23:41:15,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280593887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:41:15,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:41:15,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:41:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138056140] [2022-07-11 23:41:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:41:15,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:41:15,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:41:15,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:41:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:41:15,098 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:41:15,163 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2022-07-11 23:41:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:41:15,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-07-11 23:41:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:41:15,164 INFO L225 Difference]: With dead ends: 241 [2022-07-11 23:41:15,164 INFO L226 Difference]: Without dead ends: 199 [2022-07-11 23:41:15,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:41:15,165 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 128 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:41:15,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 345 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:41:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-11 23:41:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 166. [2022-07-11 23:41:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3) internal successors, (182), 143 states have internal predecessors, (182), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (22), 20 states have call predecessors, (22), 18 states have call successors, (22) [2022-07-11 23:41:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 223 transitions. [2022-07-11 23:41:15,173 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 223 transitions. Word has length 49 [2022-07-11 23:41:15,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:41:15,173 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 223 transitions. [2022-07-11 23:41:15,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:41:15,173 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 223 transitions. [2022-07-11 23:41:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:41:15,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:41:15,174 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:15,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-11 23:41:15,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:41:15,380 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:41:15,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:41:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash 45509775, now seen corresponding path program 1 times [2022-07-11 23:41:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:41:15,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299456464] [2022-07-11 23:41:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:41:15,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:41:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:41:15,382 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:41:15,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-11 23:41:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:41:15,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 23:41:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 23:41:15,469 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-11 23:41:15,469 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 23:41:15,470 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:41:15,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-11 23:41:15,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:41:15,674 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:41:15,676 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:41:15,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:41:15 BoogieIcfgContainer [2022-07-11 23:41:15,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:41:15,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:41:15,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:41:15,703 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:41:15,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:41:08" (3/4) ... [2022-07-11 23:41:15,704 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-11 23:41:15,758 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:41:15,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:41:15,759 INFO L158 Benchmark]: Toolchain (without parser) took 7661.40ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 41.7MB in the beginning and 32.1MB in the end (delta: 9.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-07-11 23:41:15,759 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:41:15,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.42ms. Allocated memory is still 62.9MB. Free memory was 41.5MB in the beginning and 41.6MB in the end (delta: -179.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-11 23:41:15,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.88ms. Allocated memory is still 62.9MB. Free memory was 41.5MB in the beginning and 39.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:41:15,760 INFO L158 Benchmark]: Boogie Preprocessor took 40.47ms. Allocated memory is still 62.9MB. Free memory was 39.7MB in the beginning and 38.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:41:15,760 INFO L158 Benchmark]: RCFGBuilder took 487.50ms. Allocated memory is still 62.9MB. Free memory was 38.0MB in the beginning and 40.6MB in the end (delta: -2.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-07-11 23:41:15,761 INFO L158 Benchmark]: TraceAbstraction took 6768.08ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 40.0MB in the beginning and 35.1MB in the end (delta: 5.0MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-07-11 23:41:15,761 INFO L158 Benchmark]: Witness Printer took 55.46ms. Allocated memory is still 94.4MB. Free memory was 35.1MB in the beginning and 32.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:41:15,762 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.15ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.42ms. Allocated memory is still 62.9MB. Free memory was 41.5MB in the beginning and 41.6MB in the end (delta: -179.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.88ms. Allocated memory is still 62.9MB. Free memory was 41.5MB in the beginning and 39.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.47ms. Allocated memory is still 62.9MB. Free memory was 39.7MB in the beginning and 38.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.50ms. Allocated memory is still 62.9MB. Free memory was 38.0MB in the beginning and 40.6MB in the end (delta: -2.6MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6768.08ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 40.0MB in the beginning and 35.1MB in the end (delta: 5.0MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Witness Printer took 55.46ms. Allocated memory is still 94.4MB. Free memory was 35.1MB in the beginning and 32.1MB in the end (delta: 3.0MB). 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L251] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=2147483648, e=0, m=0, res=2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648, __retres4=2147483648, e=0, m=0, res=2147483648] [L252] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=-2147483648, ea=0, ma=16777216, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=3221225472, e=64, m=0, res=3221225472] [L80] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824, __retres4=3221225472, e=64, m=0, res=3221225472] [L253] RET, EXPR base2flt(mb, eb) VAL [a=2147483648, base2flt(mb, eb)=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L273] sb = tmp___0 VAL [a=2147483648, b=3221225472, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=2147483648, \old(b)=3221225472, a=2147483648, b=3221225472] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, tmp=2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L115] delta = ea - eb VAL [\old(a)=2147483648, \old(b)=3221225472, a=3221225472, b=2147483648, delta=64, ea=64, eb=0, ma=16777216, mb=16777216, tmp=2147483648] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1236 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1204 mSDsluCounter, 6533 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 13 IncrementalHoareTripleChecker+Unchecked, 4976 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 858 IncrementalHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 1557 mSDtfsCounter, 858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 717 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=5, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 502 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 648 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 789 ConstructedInterpolants, 2 QuantifiedInterpolants, 1312 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1139 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 274/313 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 proved your program to be incorrect! [2022-07-11 23:41:15,790 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE