/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 10:41:54,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 10:41:54,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 10:41:54,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 10:41:54,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 10:41:54,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 10:41:54,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 10:41:54,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 10:41:54,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 10:41:54,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 10:41:54,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 10:41:54,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 10:41:54,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 10:41:54,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 10:41:54,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 10:41:54,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 10:41:54,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 10:41:54,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 10:41:54,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 10:41:54,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 10:41:54,373 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 10:41:54,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 10:41:54,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 10:41:54,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 10:41:54,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 10:41:54,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 10:41:54,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 10:41:54,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 10:41:54,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 10:41:54,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 10:41:54,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 10:41:54,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 10:41:54,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 10:41:54,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 10:41:54,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 10:41:54,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 10:41:54,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 10:41:54,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 10:41:54,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 10:41:54,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 10:41:54,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 10:41:54,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 10:41:54,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 10:41:54,418 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 10:41:54,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 10:41:54,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 10:41:54,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 10:41:54,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 10:41:54,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 10:41:54,420 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 10:41:54,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 10:41:54,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 10:41:54,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 10:41:54,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 10:41:54,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 10:41:54,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 10:41:54,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 10:41:54,421 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 10:41:54,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 10:41:54,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 10:41:54,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 10:41:54,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 10:41:54,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 10:41:54,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 10:41:54,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 10:41:54,422 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 10:41:54,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 10:41:54,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 10:41:54,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 10:41:54,423 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 10:41:54,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 10:41:54,423 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 10:41:54,424 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 10:41:54,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 10:41:54,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 10:41:54,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 10:41:54,668 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 10:41:54,669 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 10:41:54,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-04-06 10:41:54,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3b3747b/a14734bc71a74a69af7b31ddaa3e2c32/FLAG9f1510ca6 [2022-04-06 10:41:55,072 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 10:41:55,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2022-04-06 10:41:55,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3b3747b/a14734bc71a74a69af7b31ddaa3e2c32/FLAG9f1510ca6 [2022-04-06 10:41:55,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3b3747b/a14734bc71a74a69af7b31ddaa3e2c32 [2022-04-06 10:41:55,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 10:41:55,090 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 10:41:55,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 10:41:55,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 10:41:55,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 10:41:55,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b423e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55, skipping insertion in model container [2022-04-06 10:41:55,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 10:41:55,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 10:41:55,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-04-06 10:41:55,242 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-06 10:41:55,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 10:41:55,265 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 10:41:55,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2022-04-06 10:41:55,278 WARN L1550 CHandler]: Possible shadowing of function min [2022-04-06 10:41:55,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 10:41:55,292 INFO L208 MainTranslator]: Completed translation [2022-04-06 10:41:55,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55 WrapperNode [2022-04-06 10:41:55,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 10:41:55,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 10:41:55,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 10:41:55,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 10:41:55,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 10:41:55,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 10:41:55,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 10:41:55,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 10:41:55,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 10:41:55,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:41:55,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-06 10:41:55,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-06 10:41:55,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-04-06 10:41:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2022-04-06 10:41:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 10:41:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 10:41:55,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-04-06 10:41:55,385 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-04-06 10:41:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure task [2022-04-06 10:41:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-06 10:41:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-06 10:41:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 10:41:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 10:41:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 10:41:55,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 10:41:55,476 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 10:41:55,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 10:41:55,662 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 10:41:55,667 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 10:41:55,667 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-06 10:41:55,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:41:55 BoogieIcfgContainer [2022-04-06 10:41:55,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 10:41:55,669 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 10:41:55,669 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 10:41:55,670 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 10:41:55,672 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:41:55" (1/1) ... [2022-04-06 10:41:55,673 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 10:41:55,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 10:41:55 BasicIcfg [2022-04-06 10:41:55,690 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 10:41:55,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 10:41:55,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 10:41:55,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 10:41:55,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 10:41:55" (1/4) ... [2022-04-06 10:41:55,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad6d56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:41:55, skipping insertion in model container [2022-04-06 10:41:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:41:55" (2/4) ... [2022-04-06 10:41:55,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad6d56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:41:55, skipping insertion in model container [2022-04-06 10:41:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:41:55" (3/4) ... [2022-04-06 10:41:55,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad6d56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:41:55, skipping insertion in model container [2022-04-06 10:41:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 10:41:55" (4/4) ... [2022-04-06 10:41:55,695 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.cqvasr [2022-04-06 10:41:55,698 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 10:41:55,698 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 10:41:55,726 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 10:41:55,731 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-06 10:41:55,731 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 10:41:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-06 10:41:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 10:41:55,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:55,748 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 10:41:55,748 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash 271192072, now seen corresponding path program 1 times [2022-04-06 10:41:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:55,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40957521] [2022-04-06 10:41:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:55,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:41:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:55,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:41:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-06 10:41:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:55,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 10:41:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-06 10:41:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-06 10:41:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-06 10:41:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 10:41:56,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:41:56,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40957521] [2022-04-06 10:41:56,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40957521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:41:56,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:41:56,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-06 10:41:56,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100577167] [2022-04-06 10:41:56,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:41:56,089 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-06 10:41:56,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:41:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-06 10:41:56,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-06 10:41:56,115 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-06 10:41:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:41:56,732 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-06 10:41:56,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 10:41:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-06 10:41:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:41:56,741 INFO L225 Difference]: With dead ends: 174 [2022-04-06 10:41:56,741 INFO L226 Difference]: Without dead ends: 98 [2022-04-06 10:41:56,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-06 10:41:56,746 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 150 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 10:41:56,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 97 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 10:41:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-06 10:41:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2022-04-06 10:41:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-06 10:41:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-04-06 10:41:56,779 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2022-04-06 10:41:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:41:56,780 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-04-06 10:41:56,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-06 10:41:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-04-06 10:41:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-06 10:41:56,782 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:56,782 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 10:41:56,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 10:41:56,782 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 444305129, now seen corresponding path program 1 times [2022-04-06 10:41:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:56,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439001137] [2022-04-06 10:41:56,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:41:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:41:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-06 10:41:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-06 10:41:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-06 10:41:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-06 10:41:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-06 10:41:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-06 10:41:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-06 10:41:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-06 10:41:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:41:56,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439001137] [2022-04-06 10:41:56,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439001137] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:41:56,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17888017] [2022-04-06 10:41:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:56,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:41:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:41:56,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 10:41:57,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-06 10:41:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:57,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-06 10:41:57,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:41:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-06 10:41:57,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 10:41:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-06 10:41:57,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17888017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 10:41:57,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 10:41:57,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 15 [2022-04-06 10:41:57,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782527526] [2022-04-06 10:41:57,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 10:41:57,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-06 10:41:57,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:41:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-06 10:41:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-06 10:41:57,461 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-06 10:41:58,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:41:58,109 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2022-04-06 10:41:58,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-06 10:41:58,110 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 56 [2022-04-06 10:41:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:41:58,111 INFO L225 Difference]: With dead ends: 165 [2022-04-06 10:41:58,111 INFO L226 Difference]: Without dead ends: 97 [2022-04-06 10:41:58,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-04-06 10:41:58,113 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 183 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 10:41:58,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 88 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 10:41:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-06 10:41:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-04-06 10:41:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2022-04-06 10:41:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-04-06 10:41:58,128 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2022-04-06 10:41:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:41:58,128 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-04-06 10:41:58,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 9 states have internal predecessors, (49), 6 states have call successors, (20), 7 states have call predecessors, (20), 4 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-06 10:41:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-04-06 10:41:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-06 10:41:58,135 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:58,135 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 10:41:58,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-06 10:41:58,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:41:58,353 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:58,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 299143807, now seen corresponding path program 1 times [2022-04-06 10:41:58,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:58,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582960556] [2022-04-06 10:41:58,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:41:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:41:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-06 10:41:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:41:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-06 10:41:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-06 10:41:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-06 10:41:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-06 10:41:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-06 10:41:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-06 10:41:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-06 10:41:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-06 10:41:58,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:41:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582960556] [2022-04-06 10:41:58,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582960556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:41:58,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 10:41:58,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-06 10:41:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653221655] [2022-04-06 10:41:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:41:58,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-06 10:41:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:41:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-06 10:41:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-06 10:41:58,544 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-06 10:41:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:41:59,061 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-04-06 10:41:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-06 10:41:59,061 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2022-04-06 10:41:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:41:59,063 INFO L225 Difference]: With dead ends: 164 [2022-04-06 10:41:59,063 INFO L226 Difference]: Without dead ends: 99 [2022-04-06 10:41:59,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-06 10:41:59,064 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 10:41:59,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 84 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 10:41:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-06 10:41:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-04-06 10:41:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2022-04-06 10:41:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2022-04-06 10:41:59,074 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2022-04-06 10:41:59,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:41:59,074 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2022-04-06 10:41:59,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-06 10:41:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-06 10:41:59,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-06 10:41:59,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:59,076 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 10:41:59,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 10:41:59,076 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1890335243, now seen corresponding path program 1 times [2022-04-06 10:41:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:59,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68652186] [2022-04-06 10:41:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 10:41:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-04-06 10:41:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-06 10:41:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 10:41:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-06 10:41:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-06 10:41:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-06 10:41:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-06 10:41:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-06 10:41:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-06 10:41:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-06 10:41:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-06 10:41:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-06 10:41:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-06 10:41:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 10:41:59,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68652186] [2022-04-06 10:41:59,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68652186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 10:41:59,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43742507] [2022-04-06 10:41:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:59,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 10:41:59,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 10:41:59,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 10:41:59,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-06 10:41:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 10:41:59,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-06 10:41:59,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 10:41:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-06 10:41:59,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 10:41:59,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43742507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 10:41:59,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-06 10:41:59,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 20 [2022-04-06 10:41:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951961812] [2022-04-06 10:41:59,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 10:41:59,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 10:41:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 10:41:59,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 10:41:59,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2022-04-06 10:41:59,483 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-06 10:41:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 10:41:59,594 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2022-04-06 10:41:59,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 10:41:59,594 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2022-04-06 10:41:59,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 10:41:59,596 INFO L225 Difference]: With dead ends: 150 [2022-04-06 10:41:59,596 INFO L226 Difference]: Without dead ends: 97 [2022-04-06 10:41:59,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2022-04-06 10:41:59,597 INFO L913 BasicCegarLoop]: 104 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 10:41:59,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 706 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 10:41:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-06 10:41:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-04-06 10:41:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2022-04-06 10:41:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2022-04-06 10:41:59,605 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2022-04-06 10:41:59,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 10:41:59,605 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2022-04-06 10:41:59,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-04-06 10:41:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2022-04-06 10:41:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-06 10:41:59,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 10:41:59,606 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 10:41:59,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-06 10:41:59,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-06 10:41:59,823 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 10:41:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 10:41:59,824 INFO L85 PathProgramCache]: Analyzing trace with hash 407791861, now seen corresponding path program 1 times [2022-04-06 10:41:59,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 10:41:59,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840070273] [2022-04-06 10:41:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 10:41:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 10:41:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 10:41:59,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 10:41:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 10:41:59,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 10:41:59,904 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 10:41:59,905 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 10:41:59,906 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 10:41:59,908 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-06 10:41:59,910 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 10:41:59,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 10:41:59 BasicIcfg [2022-04-06 10:41:59,938 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 10:41:59,938 INFO L158 Benchmark]: Toolchain (without parser) took 4847.55ms. Allocated memory was 189.8MB in the beginning and 273.7MB in the end (delta: 83.9MB). Free memory was 137.5MB in the beginning and 235.7MB in the end (delta: -98.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 10:41:59,938 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 154.0MB in the beginning and 153.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 10:41:59,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.49ms. Allocated memory is still 189.8MB. Free memory was 137.2MB in the beginning and 163.6MB in the end (delta: -26.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 10:41:59,939 INFO L158 Benchmark]: Boogie Preprocessor took 33.75ms. Allocated memory is still 189.8MB. Free memory was 163.6MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 10:41:59,939 INFO L158 Benchmark]: RCFGBuilder took 340.84ms. Allocated memory is still 189.8MB. Free memory was 161.5MB in the beginning and 142.2MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-06 10:41:59,939 INFO L158 Benchmark]: IcfgTransformer took 21.58ms. Allocated memory is still 189.8MB. Free memory was 142.2MB in the beginning and 139.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 10:41:59,940 INFO L158 Benchmark]: TraceAbstraction took 4246.23ms. Allocated memory was 189.8MB in the beginning and 273.7MB in the end (delta: 83.9MB). Free memory was 139.5MB in the beginning and 235.7MB in the end (delta: -96.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 10:41:59,941 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.09ms. Allocated memory is still 189.8MB. Free memory was 154.0MB in the beginning and 153.8MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.49ms. Allocated memory is still 189.8MB. Free memory was 137.2MB in the beginning and 163.6MB in the end (delta: -26.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.75ms. Allocated memory is still 189.8MB. Free memory was 163.6MB in the beginning and 161.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 340.84ms. Allocated memory is still 189.8MB. Free memory was 161.5MB in the beginning and 142.2MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * IcfgTransformer took 21.58ms. Allocated memory is still 189.8MB. Free memory was 142.2MB in the beginning and 139.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4246.23ms. Allocated memory was 189.8MB in the beginning and 273.7MB in the end (delta: 83.9MB). Free memory was 139.5MB in the beginning and 235.7MB in the end (delta: -96.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, n={-1:0}] [L110] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L110] CALL task(nondet_tree()) VAL [t={-1:0}] [L86] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L86] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [t={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L82] CALL, EXPR size(t->left) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L82] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L82] CALL, EXPR size(t->right) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, size(t)=1, t={-1:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}] [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L92] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L93] EXPR x[0] VAL [a=2147483647, b={5:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L93] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 551 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 975 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2663 IncrementalHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 466 mSolverCounterUnsat, 325 mSDtfsCounter, 2663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 251 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 1212 SizeOfPredicates, 7 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 115/123 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-06 10:41:59,965 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...