./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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_5a.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 f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:23:04,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:23:04,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:23:04,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:23:04,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:23:04,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:23:04,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:23:04,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:23:04,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:23:04,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:23:04,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:23:04,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:23:04,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:23:04,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:23:04,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:23:04,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:23:04,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:23:04,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:23:04,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:23:04,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:23:04,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:23:04,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:23:04,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:23:04,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:23:04,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:23:04,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:23:04,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:23:04,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:23:04,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:23:04,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:23:04,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:23:04,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:23:04,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:23:04,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:23:04,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:23:04,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:23:04,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:23:04,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:23:04,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:23:04,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:23:04,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:23:04,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:23:04,430 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:23:04,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:23:04,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:23:04,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:23:04,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:23:04,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:23:04,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:23:04,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:23:04,433 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:23:04,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:23:04,434 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:23:04,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:23:04,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:23:04,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:23:04,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:23:04,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:23:04,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:23:04,435 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:23:04,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:23:04,436 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:23:04,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:23:04,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:23:04,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:23:04,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:23:04,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:23:04,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:23:04,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:23:04,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:23:04,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:23:04,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:23:04,438 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:23:04,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:23:04,438 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:23:04,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:23:04,439 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:23:04,439 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2023-02-15 10:23:04,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:23:04,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:23:04,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:23:04,698 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:23:04,698 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:23:04,700 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2023-02-15 10:23:05,817 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:23:06,010 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:23:06,011 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2023-02-15 10:23:06,018 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ff8a2a0/1596b6b366ef4caa92bb1c2492427506/FLAG5bcc55633 [2023-02-15 10:23:06,033 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ff8a2a0/1596b6b366ef4caa92bb1c2492427506 [2023-02-15 10:23:06,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:23:06,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:23:06,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:23:06,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:23:06,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:23:06,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ad4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06, skipping insertion in model container [2023-02-15 10:23:06,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:23:06,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:23:06,236 WARN L237 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_5a.c.cil.c[728,741] [2023-02-15 10:23:06,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:23:06,298 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:23:06,311 WARN L237 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_5a.c.cil.c[728,741] [2023-02-15 10:23:06,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:23:06,348 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:23:06,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06 WrapperNode [2023-02-15 10:23:06,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:23:06,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:23:06,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:23:06,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:23:06,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,388 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 166 [2023-02-15 10:23:06,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:23:06,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:23:06,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:23:06,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:23:06,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:23:06,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:23:06,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:23:06,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:23:06,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (1/1) ... [2023-02-15 10:23:06,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:23:06,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:06,474 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) [2023-02-15 10:23:06,483 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 [2023-02-15 10:23:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:23:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:23:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 10:23:06,514 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 10:23:06,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:23:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:23:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 10:23:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 10:23:06,577 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:23:06,581 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:23:07,005 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:23:07,020 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:23:07,020 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 10:23:07,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:23:07 BoogieIcfgContainer [2023-02-15 10:23:07,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:23:07,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:23:07,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:23:07,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:23:07,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:23:06" (1/3) ... [2023-02-15 10:23:07,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6173cf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:23:07, skipping insertion in model container [2023-02-15 10:23:07,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:23:06" (2/3) ... [2023-02-15 10:23:07,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6173cf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:23:07, skipping insertion in model container [2023-02-15 10:23:07,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:23:07" (3/3) ... [2023-02-15 10:23:07,035 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2023-02-15 10:23:07,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:23:07,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:23:07,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:23:07,113 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@340e0aca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:23:07,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:23:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 66 states have (on average 1.606060606060606) internal successors, (106), 68 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 10:23:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 10:23:07,129 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:07,129 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:07,130 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:07,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash -793971860, now seen corresponding path program 1 times [2023-02-15 10:23:07,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:07,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547804828] [2023-02-15 10:23:07,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:07,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 10:23:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:23:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547804828] [2023-02-15 10:23:07,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547804828] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:23:07,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:23:07,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 10:23:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727152583] [2023-02-15 10:23:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:07,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:23:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:07,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:23:07,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:23:07,535 INFO L87 Difference]: Start difference. First operand has 75 states, 66 states have (on average 1.606060606060606) internal successors, (106), 68 states have internal predecessors, (106), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:07,637 INFO L93 Difference]: Finished difference Result 181 states and 286 transitions. [2023-02-15 10:23:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:23:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 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 42 [2023-02-15 10:23:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:07,647 INFO L225 Difference]: With dead ends: 181 [2023-02-15 10:23:07,647 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 10:23:07,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 10:23:07,654 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 45 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:07,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 212 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 10:23:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-15 10:23:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 62 states have internal predecessors, (92), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:23:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2023-02-15 10:23:07,688 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 42 [2023-02-15 10:23:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:07,690 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2023-02-15 10:23:07,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2023-02-15 10:23:07,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:23:07,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:07,693 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:07,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:23:07,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:07,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1001939418, now seen corresponding path program 1 times [2023-02-15 10:23:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:07,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653280295] [2023-02-15 10:23:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:07,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 10:23:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:23:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:07,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:07,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653280295] [2023-02-15 10:23:07,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653280295] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:23:07,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:23:07,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:23:07,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822410722] [2023-02-15 10:23:07,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:07,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:23:07,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:07,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:23:07,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:23:07,844 INFO L87 Difference]: Start difference. First operand 69 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:07,882 INFO L93 Difference]: Finished difference Result 108 states and 158 transitions. [2023-02-15 10:23:07,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:23:07,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 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 44 [2023-02-15 10:23:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:07,885 INFO L225 Difference]: With dead ends: 108 [2023-02-15 10:23:07,885 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 10:23:07,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 10:23:07,887 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 88 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:07,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 295 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 10:23:07,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-02-15 10:23:07,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.467741935483871) internal successors, (91), 62 states have internal predecessors, (91), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 10:23:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2023-02-15 10:23:07,895 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 44 [2023-02-15 10:23:07,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:07,896 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2023-02-15 10:23:07,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2023-02-15 10:23:07,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 10:23:07,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:07,898 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:07,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:23:07,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:07,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:07,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1588745432, now seen corresponding path program 1 times [2023-02-15 10:23:07,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:07,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298627315] [2023-02-15 10:23:07,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 10:23:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:23:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,034 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:08,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:08,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298627315] [2023-02-15 10:23:08,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298627315] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:08,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501385096] [2023-02-15 10:23:08,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:08,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:08,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:08,044 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) [2023-02-15 10:23:08,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:23:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 10:23:08,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:23:08,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:23:08,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501385096] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:08,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:23:08,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2023-02-15 10:23:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815927102] [2023-02-15 10:23:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:08,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 10:23:08,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:08,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 10:23:08,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:23:08,522 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:08,626 INFO L93 Difference]: Finished difference Result 115 states and 167 transitions. [2023-02-15 10:23:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 10:23:08,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2023-02-15 10:23:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:08,636 INFO L225 Difference]: With dead ends: 115 [2023-02-15 10:23:08,636 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 10:23:08,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:23:08,639 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 101 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:08,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 542 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:23:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 10:23:08,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2023-02-15 10:23:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 99 states have internal predecessors, (145), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 10:23:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 158 transitions. [2023-02-15 10:23:08,655 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 158 transitions. Word has length 44 [2023-02-15 10:23:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:08,655 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 158 transitions. [2023-02-15 10:23:08,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 158 transitions. [2023-02-15 10:23:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 10:23:08,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:08,658 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:08,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:08,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:08,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1249479986, now seen corresponding path program 1 times [2023-02-15 10:23:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:08,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337036457] [2023-02-15 10:23:08,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 10:23:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:23:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:08,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:08,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337036457] [2023-02-15 10:23:08,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337036457] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:08,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211959465] [2023-02-15 10:23:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:09,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:09,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:09,001 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) [2023-02-15 10:23:09,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:23:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 10:23:09,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:09,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:09,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211959465] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:09,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:23:09,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 7] total 12 [2023-02-15 10:23:09,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65738239] [2023-02-15 10:23:09,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:09,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 10:23:09,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:09,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 10:23:09,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-15 10:23:09,171 INFO L87 Difference]: Start difference. First operand 107 states and 158 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:09,224 INFO L93 Difference]: Finished difference Result 124 states and 176 transitions. [2023-02-15 10:23:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 10:23:09,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 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 46 [2023-02-15 10:23:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:09,227 INFO L225 Difference]: With dead ends: 124 [2023-02-15 10:23:09,232 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 10:23:09,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:23:09,236 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 16 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:09,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 377 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 10:23:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2023-02-15 10:23:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 108 states have internal predecessors, (155), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 10:23:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2023-02-15 10:23:09,255 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 46 [2023-02-15 10:23:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:09,256 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2023-02-15 10:23:09,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2023-02-15 10:23:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 10:23:09,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:09,266 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:09,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 10:23:09,471 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,SelfDestructingSolverStorable3 [2023-02-15 10:23:09,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:09,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1192221684, now seen corresponding path program 1 times [2023-02-15 10:23:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:09,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648971860] [2023-02-15 10:23:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 10:23:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:23:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:09,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:09,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648971860] [2023-02-15 10:23:09,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648971860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:23:09,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:23:09,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 10:23:09,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436984713] [2023-02-15 10:23:09,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:09,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 10:23:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 10:23:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:23:09,585 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:09,612 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2023-02-15 10:23:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 10:23:09,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 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 46 [2023-02-15 10:23:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:09,614 INFO L225 Difference]: With dead ends: 122 [2023-02-15 10:23:09,614 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 10:23:09,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:23:09,615 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 2 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:09,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 480 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 10:23:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-15 10:23:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 10:23:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2023-02-15 10:23:09,622 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 46 [2023-02-15 10:23:09,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:09,623 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2023-02-15 10:23:09,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2023-02-15 10:23:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 10:23:09,624 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:09,624 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-02-15 10:23:09,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 10:23:09,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1146571609, now seen corresponding path program 1 times [2023-02-15 10:23:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:09,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243233738] [2023-02-15 10:23:09,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 10:23:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:23:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:09,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243233738] [2023-02-15 10:23:09,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243233738] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278718253] [2023-02-15 10:23:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:09,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:09,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:09,725 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) [2023-02-15 10:23:09,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:23:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:09,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 10:23:09,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:09,856 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:09,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:23:09,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278718253] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:23:09,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:23:09,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 13 [2023-02-15 10:23:09,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843940897] [2023-02-15 10:23:09,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:23:09,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 10:23:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:09,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 10:23:09,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:23:09,996 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 10:23:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:10,389 INFO L93 Difference]: Finished difference Result 426 states and 644 transitions. [2023-02-15 10:23:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 10:23:10,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 48 [2023-02-15 10:23:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:10,392 INFO L225 Difference]: With dead ends: 426 [2023-02-15 10:23:10,392 INFO L226 Difference]: Without dead ends: 311 [2023-02-15 10:23:10,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2023-02-15 10:23:10,394 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 314 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:10,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 699 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:23:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-02-15 10:23:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 140. [2023-02-15 10:23:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 127 states have internal predecessors, (177), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2023-02-15 10:23:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 208 transitions. [2023-02-15 10:23:10,415 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 208 transitions. Word has length 48 [2023-02-15 10:23:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:10,417 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 208 transitions. [2023-02-15 10:23:10,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 11 states have internal predecessors, (67), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 10:23:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 208 transitions. [2023-02-15 10:23:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 10:23:10,418 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:10,418 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-02-15 10:23:10,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:10,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:10,625 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash -348261834, now seen corresponding path program 1 times [2023-02-15 10:23:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:10,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664003531] [2023-02-15 10:23:10,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:10,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:10,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 10:23:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 10:23:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:10,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 10:23:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 10:23:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:10,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664003531] [2023-02-15 10:23:10,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664003531] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:10,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127214680] [2023-02-15 10:23:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:10,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:10,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:10,711 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) [2023-02-15 10:23:10,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:23:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:10,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:23:10,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 10:23:10,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:23:10,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127214680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:23:10,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:23:10,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-15 10:23:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576863144] [2023-02-15 10:23:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:10,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:23:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:23:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:23:10,788 INFO L87 Difference]: Start difference. First operand 140 states and 208 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 10:23:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:10,831 INFO L93 Difference]: Finished difference Result 277 states and 411 transitions. [2023-02-15 10:23:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:23:10,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2023-02-15 10:23:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:10,833 INFO L225 Difference]: With dead ends: 277 [2023-02-15 10:23:10,834 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 10:23:10,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:23:10,837 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:10,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 247 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 10:23:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2023-02-15 10:23:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.4045801526717556) internal successors, (184), 133 states have internal predecessors, (184), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (27), 8 states have call predecessors, (27), 7 states have call successors, (27) [2023-02-15 10:23:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2023-02-15 10:23:10,867 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 55 [2023-02-15 10:23:10,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:10,867 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2023-02-15 10:23:10,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 10:23:10,867 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2023-02-15 10:23:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 10:23:10,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:10,869 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:10,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:11,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:11,075 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:11,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1206174656, now seen corresponding path program 1 times [2023-02-15 10:23:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:11,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742009542] [2023-02-15 10:23:11,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 10:23:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-02-15 10:23:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:11,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742009542] [2023-02-15 10:23:11,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742009542] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:11,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413930035] [2023-02-15 10:23:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:11,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:11,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:11,135 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) [2023-02-15 10:23:11,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:23:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 10:23:11,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 10:23:11,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 10:23:11,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413930035] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:23:11,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 10:23:11,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2023-02-15 10:23:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941772757] [2023-02-15 10:23:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:11,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:23:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:11,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:23:11,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 10:23:11,225 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 10:23:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:11,268 INFO L93 Difference]: Finished difference Result 303 states and 458 transitions. [2023-02-15 10:23:11,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:23:11,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2023-02-15 10:23:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:11,272 INFO L225 Difference]: With dead ends: 303 [2023-02-15 10:23:11,272 INFO L226 Difference]: Without dead ends: 166 [2023-02-15 10:23:11,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:23:11,274 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 20 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:11,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 252 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-15 10:23:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2023-02-15 10:23:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 150 states have internal predecessors, (204), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) [2023-02-15 10:23:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2023-02-15 10:23:11,291 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 58 [2023-02-15 10:23:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:11,292 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2023-02-15 10:23:11,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 10:23:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2023-02-15 10:23:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 10:23:11,293 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:11,293 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-02-15 10:23:11,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:11,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:11,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:11,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1532583322, now seen corresponding path program 1 times [2023-02-15 10:23:11,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:11,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405448424] [2023-02-15 10:23:11,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 10:23:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-15 10:23:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:11,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405448424] [2023-02-15 10:23:11,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405448424] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:11,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638096593] [2023-02-15 10:23:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:11,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:11,603 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) [2023-02-15 10:23:11,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:23:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:11,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 10:23:11,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-15 10:23:11,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:11,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638096593] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:23:11,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:23:11,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-02-15 10:23:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951338658] [2023-02-15 10:23:11,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:23:11,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:23:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:23:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:23:11,769 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 10:23:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:11,890 INFO L93 Difference]: Finished difference Result 419 states and 656 transitions. [2023-02-15 10:23:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:23:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2023-02-15 10:23:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:11,896 INFO L225 Difference]: With dead ends: 419 [2023-02-15 10:23:11,896 INFO L226 Difference]: Without dead ends: 265 [2023-02-15 10:23:11,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2023-02-15 10:23:11,898 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 155 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:11,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 401 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:23:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-02-15 10:23:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 191. [2023-02-15 10:23:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.4252873563218391) internal successors, (248), 178 states have internal predecessors, (248), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) [2023-02-15 10:23:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 288 transitions. [2023-02-15 10:23:11,914 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 288 transitions. Word has length 61 [2023-02-15 10:23:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:11,914 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 288 transitions. [2023-02-15 10:23:11,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 10:23:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 288 transitions. [2023-02-15 10:23:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 10:23:11,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:11,915 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:11,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:12,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:12,116 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:12,116 INFO L85 PathProgramCache]: Analyzing trace with hash -973321366, now seen corresponding path program 1 times [2023-02-15 10:23:12,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:12,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654577631] [2023-02-15 10:23:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 10:23:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:23:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654577631] [2023-02-15 10:23:12,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654577631] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:12,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313575546] [2023-02-15 10:23:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:12,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:12,231 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) [2023-02-15 10:23:12,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:23:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:23:12,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:12,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:12,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313575546] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:12,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:23:12,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 9 [2023-02-15 10:23:12,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442140850] [2023-02-15 10:23:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:12,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 10:23:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 10:23:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:23:12,361 INFO L87 Difference]: Start difference. First operand 191 states and 288 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:12,378 INFO L93 Difference]: Finished difference Result 247 states and 363 transitions. [2023-02-15 10:23:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 10:23:12,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 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 63 [2023-02-15 10:23:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:12,381 INFO L225 Difference]: With dead ends: 247 [2023-02-15 10:23:12,381 INFO L226 Difference]: Without dead ends: 196 [2023-02-15 10:23:12,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:23:12,382 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 147 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 [2023-02-15 10:23:12,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 147 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-15 10:23:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 191. [2023-02-15 10:23:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.4137931034482758) internal successors, (246), 178 states have internal predecessors, (246), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (32), 8 states have call predecessors, (32), 7 states have call successors, (32) [2023-02-15 10:23:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 286 transitions. [2023-02-15 10:23:12,398 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 286 transitions. Word has length 63 [2023-02-15 10:23:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:12,399 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 286 transitions. [2023-02-15 10:23:12,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 286 transitions. [2023-02-15 10:23:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 10:23:12,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:12,400 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2023-02-15 10:23:12,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:12,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:12,607 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:12,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash 16165131, now seen corresponding path program 1 times [2023-02-15 10:23:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:12,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377831994] [2023-02-15 10:23:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 10:23:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:23:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 10:23:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 10:23:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:12,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377831994] [2023-02-15 10:23:12,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377831994] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:12,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221977269] [2023-02-15 10:23:12,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:12,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:12,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:12,875 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) [2023-02-15 10:23:12,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:23:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:12,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 10:23:12,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 10:23:13,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 10:23:13,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221977269] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:23:13,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:23:13,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 12] total 25 [2023-02-15 10:23:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374805127] [2023-02-15 10:23:13,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:23:13,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 10:23:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:13,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 10:23:13,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-02-15 10:23:13,342 INFO L87 Difference]: Start difference. First operand 191 states and 286 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 21 states have internal predecessors, (74), 4 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 10:23:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:14,000 INFO L93 Difference]: Finished difference Result 341 states and 501 transitions. [2023-02-15 10:23:14,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 10:23:14,001 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 21 states have internal predecessors, (74), 4 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) Word has length 63 [2023-02-15 10:23:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:14,002 INFO L225 Difference]: With dead ends: 341 [2023-02-15 10:23:14,002 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 10:23:14,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=1296, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 10:23:14,004 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 139 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:14,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1146 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:23:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 10:23:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 104. [2023-02-15 10:23:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 10:23:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2023-02-15 10:23:14,013 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 63 [2023-02-15 10:23:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:14,014 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2023-02-15 10:23:14,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 21 states have internal predecessors, (74), 4 states have call successors, (11), 2 states have call predecessors, (11), 6 states have return successors, (12), 7 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 10:23:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2023-02-15 10:23:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 10:23:14,015 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:14,015 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:14,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:14,221 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,SelfDestructingSolverStorable10 [2023-02-15 10:23:14,221 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:14,221 INFO L85 PathProgramCache]: Analyzing trace with hash -848130451, now seen corresponding path program 1 times [2023-02-15 10:23:14,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:14,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950003519] [2023-02-15 10:23:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:14,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 10:23:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:23:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:23:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:14,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950003519] [2023-02-15 10:23:14,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950003519] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:14,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997094944] [2023-02-15 10:23:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:14,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:14,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:14,330 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) [2023-02-15 10:23:14,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 10:23:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 10:23:14,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:23:14,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:23:14,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997094944] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:23:14,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:23:14,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-02-15 10:23:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322933289] [2023-02-15 10:23:14,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:23:14,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 10:23:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 10:23:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:23:14,555 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 10:23:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:14,657 INFO L93 Difference]: Finished difference Result 214 states and 301 transitions. [2023-02-15 10:23:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:23:14,658 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 64 [2023-02-15 10:23:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:14,659 INFO L225 Difference]: With dead ends: 214 [2023-02-15 10:23:14,659 INFO L226 Difference]: Without dead ends: 178 [2023-02-15 10:23:14,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2023-02-15 10:23:14,660 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 215 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:14,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1213 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:23:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-15 10:23:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 120. [2023-02-15 10:23:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 109 states have internal predecessors, (146), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (19), 6 states have call predecessors, (19), 5 states have call successors, (19) [2023-02-15 10:23:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 171 transitions. [2023-02-15 10:23:14,671 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 171 transitions. Word has length 64 [2023-02-15 10:23:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:14,671 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 171 transitions. [2023-02-15 10:23:14,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 17 states have internal predecessors, (81), 5 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 10:23:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 171 transitions. [2023-02-15 10:23:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 10:23:14,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:14,673 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:14,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:14,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:14,879 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash -629275733, now seen corresponding path program 1 times [2023-02-15 10:23:14,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:14,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886136870] [2023-02-15 10:23:14,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:14,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 10:23:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:23:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:23:14,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886136870] [2023-02-15 10:23:14,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886136870] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:23:14,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:23:14,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 10:23:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946270125] [2023-02-15 10:23:14,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:14,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 10:23:14,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 10:23:14,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 10:23:14,986 INFO L87 Difference]: Start difference. First operand 120 states and 171 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:15,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:15,037 INFO L93 Difference]: Finished difference Result 171 states and 235 transitions. [2023-02-15 10:23:15,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 10:23:15,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2023-02-15 10:23:15,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:15,039 INFO L225 Difference]: With dead ends: 171 [2023-02-15 10:23:15,039 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 10:23:15,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 10:23:15,040 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:15,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 524 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 10:23:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-02-15 10:23:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 109 states have internal predecessors, (146), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-02-15 10:23:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 165 transitions. [2023-02-15 10:23:15,049 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 165 transitions. Word has length 64 [2023-02-15 10:23:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:15,050 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 165 transitions. [2023-02-15 10:23:15,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 165 transitions. [2023-02-15 10:23:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 10:23:15,051 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:15,051 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:15,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 10:23:15,051 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1085833987, now seen corresponding path program 1 times [2023-02-15 10:23:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:15,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965846134] [2023-02-15 10:23:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 10:23:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:23:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 10:23:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:15,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965846134] [2023-02-15 10:23:15,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965846134] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:23:15,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:23:15,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 10:23:15,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641052469] [2023-02-15 10:23:15,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:15,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 10:23:15,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:15,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 10:23:15,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 10:23:15,201 INFO L87 Difference]: Start difference. First operand 120 states and 165 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:15,280 INFO L93 Difference]: Finished difference Result 233 states and 318 transitions. [2023-02-15 10:23:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:23:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 71 [2023-02-15 10:23:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:15,282 INFO L225 Difference]: With dead ends: 233 [2023-02-15 10:23:15,282 INFO L226 Difference]: Without dead ends: 206 [2023-02-15 10:23:15,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:23:15,283 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 126 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:15,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 629 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-02-15 10:23:15,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 151. [2023-02-15 10:23:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 138 states have internal predecessors, (179), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (20), 8 states have call predecessors, (20), 5 states have call successors, (20) [2023-02-15 10:23:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 205 transitions. [2023-02-15 10:23:15,295 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 205 transitions. Word has length 71 [2023-02-15 10:23:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:15,295 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 205 transitions. [2023-02-15 10:23:15,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 205 transitions. [2023-02-15 10:23:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 10:23:15,296 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:15,296 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:15,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 10:23:15,297 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:15,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1929269631, now seen corresponding path program 1 times [2023-02-15 10:23:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:15,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360789474] [2023-02-15 10:23:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 10:23:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-02-15 10:23:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 10:23:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:15,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360789474] [2023-02-15 10:23:15,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360789474] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:15,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431572050] [2023-02-15 10:23:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:15,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:15,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:15,421 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) [2023-02-15 10:23:15,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 10:23:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 10:23:15,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 10:23:15,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-02-15 10:23:15,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431572050] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:15,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 10:23:15,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 11 [2023-02-15 10:23:15,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444650425] [2023-02-15 10:23:15,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:15,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:23:15,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:15,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:23:15,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:23:15,599 INFO L87 Difference]: Start difference. First operand 151 states and 205 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:15,615 INFO L93 Difference]: Finished difference Result 191 states and 256 transitions. [2023-02-15 10:23:15,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:23:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 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 71 [2023-02-15 10:23:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:15,617 INFO L225 Difference]: With dead ends: 191 [2023-02-15 10:23:15,617 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 10:23:15,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:23:15,618 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:15,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 186 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 10:23:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2023-02-15 10:23:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 120 states have internal predecessors, (154), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-15 10:23:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2023-02-15 10:23:15,628 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 71 [2023-02-15 10:23:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:15,628 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2023-02-15 10:23:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2023-02-15 10:23:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 10:23:15,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:15,629 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:15,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:15,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-15 10:23:15,835 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:15,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1245795635, now seen corresponding path program 1 times [2023-02-15 10:23:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:15,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979798205] [2023-02-15 10:23:15,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:15,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 10:23:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 10:23:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-15 10:23:15,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979798205] [2023-02-15 10:23:15,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979798205] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:23:15,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:23:15,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:23:15,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169246114] [2023-02-15 10:23:15,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:23:15,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:23:15,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:15,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:23:15,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:23:15,964 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:15,991 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2023-02-15 10:23:15,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:23:15,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 2 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 76 [2023-02-15 10:23:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:15,992 INFO L225 Difference]: With dead ends: 169 [2023-02-15 10:23:15,992 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 10:23:15,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:23:15,993 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:15,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 258 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:23:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 10:23:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2023-02-15 10:23:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3057851239669422) internal successors, (158), 124 states have internal predecessors, (158), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-02-15 10:23:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2023-02-15 10:23:16,003 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 76 [2023-02-15 10:23:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:16,004 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 176 transitions. [2023-02-15 10:23:16,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 10:23:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2023-02-15 10:23:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 10:23:16,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:16,005 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:16,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 10:23:16,005 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:16,006 INFO L85 PathProgramCache]: Analyzing trace with hash 428147185, now seen corresponding path program 1 times [2023-02-15 10:23:16,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:16,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897729850] [2023-02-15 10:23:16,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:16,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 10:23:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 10:23:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:16,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897729850] [2023-02-15 10:23:16,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897729850] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:16,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139728333] [2023-02-15 10:23:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:16,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:16,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:16,134 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) [2023-02-15 10:23:16,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 10:23:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 10:23:16,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:16,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:16,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139728333] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:23:16,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:23:16,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-15 10:23:16,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8926033] [2023-02-15 10:23:16,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:23:16,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:23:16,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:23:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:23:16,315 INFO L87 Difference]: Start difference. First operand 134 states and 176 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 10:23:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:16,417 INFO L93 Difference]: Finished difference Result 262 states and 345 transitions. [2023-02-15 10:23:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:23:16,417 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 76 [2023-02-15 10:23:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:16,418 INFO L225 Difference]: With dead ends: 262 [2023-02-15 10:23:16,418 INFO L226 Difference]: Without dead ends: 223 [2023-02-15 10:23:16,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:23:16,419 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 291 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:16,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1095 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:23:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-15 10:23:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 154. [2023-02-15 10:23:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 141 states have internal predecessors, (179), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-15 10:23:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 202 transitions. [2023-02-15 10:23:16,429 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 202 transitions. Word has length 76 [2023-02-15 10:23:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:16,430 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 202 transitions. [2023-02-15 10:23:16,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 12 states have internal predecessors, (70), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 10:23:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 202 transitions. [2023-02-15 10:23:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 10:23:16,431 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:16,431 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:16,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:16,636 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,SelfDestructingSolverStorable16 [2023-02-15 10:23:16,637 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash -851716493, now seen corresponding path program 1 times [2023-02-15 10:23:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:16,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092340679] [2023-02-15 10:23:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 10:23:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-02-15 10:23:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:23:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092340679] [2023-02-15 10:23:16,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092340679] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204096923] [2023-02-15 10:23:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:16,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:16,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:16,762 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) [2023-02-15 10:23:16,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 10:23:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:16,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 10:23:16,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:16,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204096923] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:23:17,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:23:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 12] total 21 [2023-02-15 10:23:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910896587] [2023-02-15 10:23:17,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:23:17,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 10:23:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:17,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 10:23:17,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2023-02-15 10:23:17,147 INFO L87 Difference]: Start difference. First operand 154 states and 202 transitions. Second operand has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 10:23:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:17,568 INFO L93 Difference]: Finished difference Result 356 states and 473 transitions. [2023-02-15 10:23:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:23:17,568 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 76 [2023-02-15 10:23:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:17,570 INFO L225 Difference]: With dead ends: 356 [2023-02-15 10:23:17,570 INFO L226 Difference]: Without dead ends: 211 [2023-02-15 10:23:17,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2023-02-15 10:23:17,571 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 214 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:17,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 920 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:23:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-15 10:23:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 154. [2023-02-15 10:23:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 140 states have (on average 1.2642857142857142) internal successors, (177), 141 states have internal predecessors, (177), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (17), 8 states have call predecessors, (17), 5 states have call successors, (17) [2023-02-15 10:23:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 200 transitions. [2023-02-15 10:23:17,583 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 200 transitions. Word has length 76 [2023-02-15 10:23:17,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:17,583 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 200 transitions. [2023-02-15 10:23:17,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.761904761904762) internal successors, (100), 19 states have internal predecessors, (100), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-15 10:23:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 200 transitions. [2023-02-15 10:23:17,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-02-15 10:23:17,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:23:17,584 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:17,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:17,790 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,SelfDestructingSolverStorable17 [2023-02-15 10:23:17,790 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:23:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:23:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash -141123505, now seen corresponding path program 1 times [2023-02-15 10:23:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:23:17,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977344554] [2023-02-15 10:23:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:23:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 10:23:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 10:23:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:17,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 10:23:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:17,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 10:23:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 10:23:17,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:23:17,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977344554] [2023-02-15 10:23:17,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977344554] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:23:17,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706090017] [2023-02-15 10:23:17,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:23:17,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:17,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:23:17,946 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) [2023-02-15 10:23:17,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 10:23:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:23:18,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 10:23:18,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:23:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-15 10:23:18,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:23:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-02-15 10:23:18,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706090017] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:23:18,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:23:18,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 18 [2023-02-15 10:23:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29043256] [2023-02-15 10:23:18,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:23:18,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 10:23:18,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:23:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 10:23:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-02-15 10:23:18,307 INFO L87 Difference]: Start difference. First operand 154 states and 200 transitions. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 10:23:18,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:23:18,680 INFO L93 Difference]: Finished difference Result 270 states and 358 transitions. [2023-02-15 10:23:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 10:23:18,680 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 79 [2023-02-15 10:23:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:23:18,681 INFO L225 Difference]: With dead ends: 270 [2023-02-15 10:23:18,681 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 10:23:18,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2023-02-15 10:23:18,682 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 188 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:23:18,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 182 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:23:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 10:23:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 10:23:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:23:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 10:23:18,683 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2023-02-15 10:23:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:23:18,683 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 10:23:18,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 10:23:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 10:23:18,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 10:23:18,686 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 10:23:18,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 10:23:18,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:23:18,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 10:23:20,148 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-15 10:23:20,148 INFO L899 garLoopResultBuilder]: For program point L77-2(line 77) no Hoare annotation was computed. [2023-02-15 10:23:20,148 INFO L899 garLoopResultBuilder]: For program point L77-4(line 77) no Hoare annotation was computed. [2023-02-15 10:23:20,148 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~m| 0)))) (and (or (not (= |base2flt_#in~m| |base2flt_#in~e|)) (not (= |base2flt_#in~e| 0))) (<= |base2flt_#in~e| base2flt_~e) (or (< (mod base2flt_~__retres4~0 4294967296) 1) .cse0) (or .cse0 (< (mod |base2flt_#res| 4294967296) 1)) (not (= |base2flt_#in~m| 1)))) [2023-02-15 10:23:20,148 INFO L895 garLoopResultBuilder]: At program point $Ultimate##27(line 76) the Hoare annotation is: (let ((.cse3 (not (= |base2flt_#in~m| 0)))) (let ((.cse0 (or (not (= |base2flt_#in~m| |base2flt_#in~e|)) (not (= |base2flt_#in~e| 0)))) (.cse1 (or (< (mod base2flt_~__retres4~0 4294967296) 1) .cse3)) (.cse2 (or .cse3 (< (mod |base2flt_#res| 4294967296) 1)))) (or (and (<= base2flt_~e |base2flt_#in~e|) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (not (= |base2flt_#in~m| 1)))))) [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L895 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (let ((.cse0 (<= base2flt_~e |base2flt_#in~e|)) (.cse1 (or (not (= |base2flt_#in~m| |base2flt_#in~e|)) (not (= |base2flt_#in~e| 0)))) (.cse2 (or (not (= |base2flt_#in~m| 0)) (< (mod |base2flt_#res| 4294967296) 1)))) (or (and .cse0 (= base2flt_~m |base2flt_#in~m|) (<= |base2flt_#in~e| base2flt_~e) (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0)) (and .cse0 .cse1 .cse2) (and .cse1 .cse2 (not (= |base2flt_#in~m| 1))))) [2023-02-15 10:23:20,149 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: (let ((.cse0 (not (= |base2flt_#in~m| 0)))) (and (<= base2flt_~e |base2flt_#in~e|) (or (not (= |base2flt_#in~m| |base2flt_#in~e|)) (not (= |base2flt_#in~e| 0))) (or (< (mod base2flt_~__retres4~0 4294967296) 1) .cse0) (or .cse0 (< (mod |base2flt_#res| 4294967296) 1)))) [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L76-3(line 76) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L176-2(line 176) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point L176-4(line 176) no Hoare annotation was computed. [2023-02-15 10:23:20,149 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 220 276) the Hoare annotation is: true [2023-02-15 10:23:20,149 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 252) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L243-2(lines 243 252) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L260-2(lines 260 264) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L895 garLoopResultBuilder]: At program point mulflt_returnLabel#1(lines 147 219) the Hoare annotation is: (or (and (< (mod |ULTIMATE.start_mulflt_#res#1| 4294967296) 1) (< (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 1) (< (mod |ULTIMATE.start_mulflt_~__retres10~1#1| 4294967296) 1)) (and (= |ULTIMATE.start_main_~sb~0#1| 1) (= |ULTIMATE.start_main_~tmp~2#1| 1)) (<= (+ |ULTIMATE.start_main_~sb~0#1| 1) 0)) [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L171-2(line 171) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L171-4(line 171) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 250) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2023-02-15 10:23:20,150 INFO L899 garLoopResultBuilder]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L213-2(line 213) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L213-4(line 213) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L902 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: true [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L238-1(line 238) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L214-2(line 214) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L214-4(line 214) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: (= |ULTIMATE.start_main_~zero~0#1| 0) [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L239-1(line 239) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L173-2(line 173) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L173-4(line 173) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L256(lines 256 272) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L256-1(lines 256 272) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L895 garLoopResultBuilder]: At program point L240(line 240) the Hoare annotation is: (= |ULTIMATE.start_main_~zero~0#1| 0) [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L240-1(line 240) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L174(line 174) no Hoare annotation was computed. [2023-02-15 10:23:20,151 INFO L899 garLoopResultBuilder]: For program point L174-2(line 174) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point L174-4(line 174) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L895 garLoopResultBuilder]: At program point L257-2(lines 257 266) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~tmp___1~0#1|) (= 0 |ULTIMATE.start_main_~tmp___0~0#1|)) [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L895 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: (or (and (< (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 1) (< (mod |ULTIMATE.start_mulflt_~__retres10~1#1| 4294967296) 1)) (and (= |ULTIMATE.start_main_~sb~0#1| 1) (= |ULTIMATE.start_main_~tmp~2#1| 1)) (<= (+ |ULTIMATE.start_main_~sb~0#1| 1) 0)) [2023-02-15 10:23:20,152 INFO L895 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: (or (= |ULTIMATE.start_main_~zero~0#1| 0) (and (= |ULTIMATE.start_main_~a~0#1| 0) (< (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 1))) [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-15 10:23:20,152 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-15 10:23:20,152 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-02-15 10:23:20,157 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:23:20,159 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 10:23:20,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:23:20 BoogieIcfgContainer [2023-02-15 10:23:20,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 10:23:20,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 10:23:20,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 10:23:20,187 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 10:23:20,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:23:07" (3/4) ... [2023-02-15 10:23:20,189 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 10:23:20,194 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-15 10:23:20,194 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 10:23:20,204 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2023-02-15 10:23:20,204 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-02-15 10:23:20,205 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-15 10:23:20,205 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 10:23:20,225 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((e <= \old(e) && m == \old(m)) && \old(e) <= e) && __retres4 <= 0) && 0 <= __retres4) || ((e <= \old(e) && (!(\old(m) == \old(e)) || !(\old(e) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1))) || (((!(\old(m) == \old(e)) || !(\old(e) == 0)) && (!(\old(m) == 0) || \result % 4294967296 < 1)) && !(\old(m) == 1)) [2023-02-15 10:23:20,226 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((e <= \old(e) && (!(\old(m) == \old(e)) || !(\old(e) == 0))) && (__retres4 % 4294967296 < 1 || !(\old(m) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1) [2023-02-15 10:23:20,226 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(m) == \old(e)) || !(\old(e) == 0)) && \old(e) <= e) && (__retres4 % 4294967296 < 1 || !(\old(m) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1)) && !(\old(m) == 1) [2023-02-15 10:23:20,226 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((e <= \old(e) && (!(\old(m) == \old(e)) || !(\old(e) == 0))) && (__retres4 % 4294967296 < 1 || !(\old(m) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1)) || ((((!(\old(m) == \old(e)) || !(\old(e) == 0)) && (__retres4 % 4294967296 < 1 || !(\old(m) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1)) && !(\old(m) == 1)) [2023-02-15 10:23:20,228 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result % 4294967296 < 1 && zero % 4294967296 < 1) && __retres10 % 4294967296 < 1) || (sb == 1 && tmp == 1)) || sb + 1 <= 0 [2023-02-15 10:23:20,254 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 10:23:20,254 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 10:23:20,255 INFO L158 Benchmark]: Toolchain (without parser) took 14218.30ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 99.7MB in the beginning and 120.7MB in the end (delta: -21.0MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2023-02-15 10:23:20,255 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 10:23:20,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.30ms. Allocated memory is still 138.4MB. Free memory was 99.6MB in the beginning and 102.0MB in the end (delta: -2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:23:20,256 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.90ms. Allocated memory is still 138.4MB. Free memory was 102.0MB in the beginning and 99.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:23:20,256 INFO L158 Benchmark]: Boogie Preprocessor took 24.97ms. Allocated memory is still 138.4MB. Free memory was 99.9MB in the beginning and 98.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 10:23:20,256 INFO L158 Benchmark]: RCFGBuilder took 605.16ms. Allocated memory is still 138.4MB. Free memory was 97.8MB in the beginning and 78.3MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 10:23:20,257 INFO L158 Benchmark]: TraceAbstraction took 13158.74ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 77.7MB in the beginning and 126.0MB in the end (delta: -48.3MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2023-02-15 10:23:20,257 INFO L158 Benchmark]: Witness Printer took 67.76ms. Allocated memory is still 243.3MB. Free memory was 126.0MB in the beginning and 120.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 10:23:20,260 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 111.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.30ms. Allocated memory is still 138.4MB. Free memory was 99.6MB in the beginning and 102.0MB in the end (delta: -2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.90ms. Allocated memory is still 138.4MB. Free memory was 102.0MB in the beginning and 99.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.97ms. Allocated memory is still 138.4MB. Free memory was 99.9MB in the beginning and 98.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 605.16ms. Allocated memory is still 138.4MB. Free memory was 97.8MB in the beginning and 78.3MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13158.74ms. Allocated memory was 138.4MB in the beginning and 243.3MB in the end (delta: 104.9MB). Free memory was 77.7MB in the beginning and 126.0MB in the end (delta: -48.3MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. * Witness Printer took 67.76ms. Allocated memory is still 243.3MB. Free memory was 126.0MB in the beginning and 120.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2027 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2023 mSDsluCounter, 9805 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8135 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2561 IncrementalHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 1670 mSDtfsCounter, 2561 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1807 GetRequests, 1561 SyntacticMatches, 2 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=9, InterpolantAutomatonStates: 168, 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, 19 MinimizatonAttempts, 553 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 217 PreInvPairs, 672 NumberOfFragments, 285 HoareAnnotationTreeSize, 217 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 101623 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1951 NumberOfCodeBlocks, 1951 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2599 ConstructedInterpolants, 0 QuantifiedInterpolants, 4788 SizeOfPredicates, 58 NumberOfNonLiveVariables, 2495 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 43 InterpolantComputations, 12 PerfectInterpolantSequences, 1177/1454 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((e <= \old(e) && (!(\old(m) == \old(e)) || !(\old(e) == 0))) && (__retres4 % 4294967296 < 1 || !(\old(m) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1)) || ((((!(\old(m) == \old(e)) || !(\old(e) == 0)) && (__retres4 % 4294967296 < 1 || !(\old(m) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1)) && !(\old(m) == 1)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((zero % 4294967296 < 1 && __retres10 % 4294967296 < 1) || (sb == 1 && tmp == 1)) || sb + 1 <= 0 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((e <= \old(e) && m == \old(m)) && \old(e) <= e) && __retres4 <= 0) && 0 <= __retres4) || ((e <= \old(e) && (!(\old(m) == \old(e)) || !(\old(e) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1))) || (((!(\old(m) == \old(e)) || !(\old(e) == 0)) && (!(\old(m) == 0) || \result % 4294967296 < 1)) && !(\old(m) == 1)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((e <= \old(e) && (!(\old(m) == \old(e)) || !(\old(e) == 0))) && (__retres4 % 4294967296 < 1 || !(\old(m) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((!(\old(m) == \old(e)) || !(\old(e) == 0)) && \old(e) <= e) && (__retres4 % 4294967296 < 1 || !(\old(m) == 0))) && (!(\old(m) == 0) || \result % 4294967296 < 1)) && !(\old(m) == 1) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((\result % 4294967296 < 1 && zero % 4294967296 < 1) && __retres10 % 4294967296 < 1) || (sb == 1 && tmp == 1)) || sb + 1 <= 0 RESULT: Ultimate proved your program to be correct! [2023-02-15 10:23:20,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE