/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:35:35,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:35:35,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:35:35,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:35:35,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:35:35,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:35:35,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:35:35,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:35:35,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:35:35,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:35:35,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:35:35,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:35:35,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:35:35,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:35:35,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:35:35,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:35:35,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:35:35,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:35:35,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:35:35,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:35:35,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:35:35,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:35:35,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:35:35,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:35:35,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:35:35,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:35:35,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:35:35,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:35:35,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:35:35,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:35:35,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:35:35,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:35:35,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:35:35,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:35:35,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:35:35,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:35:35,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:35:35,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:35:35,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:35:35,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:35:35,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:35:35,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:35:35,840 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:35:35,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:35:35,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:35:35,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:35:35,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:35:35,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:35:35,841 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:35:35,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:35:35,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:35:35,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:35:35,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:35:35,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:35:35,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:35:35,842 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:35:35,842 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:35:35,842 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:35:35,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:35:35,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:35:35,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:35:35,843 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:35:35,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:35:35,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:35:35,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:35:35,844 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:35:35,844 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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-01-10 12:35:36,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:35:36,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:35:36,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:35:36,057 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:35:36,058 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:35:36,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2022-01-10 12:35:36,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2647e5d88/bea070b46f61437fb237f41f39046326/FLAG9098268bf [2022-01-10 12:35:36,511 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:35:36,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2022-01-10 12:35:36,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2647e5d88/bea070b46f61437fb237f41f39046326/FLAG9098268bf [2022-01-10 12:35:36,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2647e5d88/bea070b46f61437fb237f41f39046326 [2022-01-10 12:35:36,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:35:36,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:35:36,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:35:36,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:35:36,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:35:36,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:35:36" (1/1) ... [2022-01-10 12:35:36,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cb21de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:36, skipping insertion in model container [2022-01-10 12:35:36,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:35:36" (1/1) ... [2022-01-10 12:35:36,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:35:36,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:35:37,105 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_rec.c[585,598] [2022-01-10 12:35:37,127 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 12:35:37,128 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 12:35:37,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:35:37,159 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 12:35:37,163 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:35:37,166 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_rec.c[585,598] [2022-01-10 12:35:37,170 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 12:35:37,171 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 12:35:37,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:35:37,185 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:35:37,193 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_rec.c[585,598] [2022-01-10 12:35:37,215 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 12:35:37,216 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-10 12:35:37,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:35:37,242 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:35:37,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37 WrapperNode [2022-01-10 12:35:37,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:35:37,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:35:37,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:35:37,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:35:37,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,290 INFO L137 Inliner]: procedures = 31, calls = 61, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 95 [2022-01-10 12:35:37,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:35:37,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:35:37,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:35:37,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:35:37,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:35:37,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:35:37,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:35:37,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:35:37,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:35:37,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:35:37,385 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-01-10 12:35:37,386 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-01-10 12:35:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:35:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:35:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 12:35:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 12:35:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-01-10 12:35:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-01-10 12:35:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-01-10 12:35:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-01-10 12:35:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 12:35:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 12:35:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-01-10 12:35:37,412 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-01-10 12:35:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 12:35:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-01-10 12:35:37,412 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-01-10 12:35:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:35:37,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:35:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-01-10 12:35:37,412 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-01-10 12:35:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 12:35:37,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 12:35:37,482 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:35:37,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:35:37,794 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:35:37,799 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:35:37,799 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 12:35:37,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:35:37 BoogieIcfgContainer [2022-01-10 12:35:37,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:35:37,801 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:35:37,802 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:35:37,815 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:35:37,817 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:35:37" (1/1) ... [2022-01-10 12:35:37,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:35:37 BasicIcfg [2022-01-10 12:35:37,971 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:35:37,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:35:37,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:35:37,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:35:37,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:35:36" (1/4) ... [2022-01-10 12:35:37,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33602654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:35:37, skipping insertion in model container [2022-01-10 12:35:37,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:35:37" (2/4) ... [2022-01-10 12:35:37,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33602654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:35:37, skipping insertion in model container [2022-01-10 12:35:37,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:35:37" (3/4) ... [2022-01-10 12:35:37,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33602654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:35:37, skipping insertion in model container [2022-01-10 12:35:37,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:35:37" (4/4) ... [2022-01-10 12:35:37,983 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec.cTransformedIcfg [2022-01-10 12:35:37,987 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:35:37,987 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 12:35:38,016 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:35:38,021 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 12:35:38,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 12:35:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-10 12:35:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 12:35:38,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:35:38,036 INFO L514 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] [2022-01-10 12:35:38,036 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 12:35:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:35:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1955774906, now seen corresponding path program 1 times [2022-01-10 12:35:38,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:35:38,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861108833] [2022-01-10 12:35:38,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:38,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:35:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:38,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 12:35:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:38,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 12:35:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 12:35:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:35:38,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:35:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861108833] [2022-01-10 12:35:38,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861108833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:35:38,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:35:38,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 12:35:38,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140817321] [2022-01-10 12:35:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:35:38,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 12:35:38,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:35:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 12:35:38,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:35:38,400 INFO L87 Difference]: Start difference. First operand has 85 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 12:35:40,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 12:35:41,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:35:41,242 INFO L93 Difference]: Finished difference Result 152 states and 205 transitions. [2022-01-10 12:35:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:35:41,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-01-10 12:35:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:35:41,250 INFO L225 Difference]: With dead ends: 152 [2022-01-10 12:35:41,250 INFO L226 Difference]: Without dead ends: 86 [2022-01-10 12:35:41,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 12:35:41,253 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 27 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-10 12:35:41,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 340 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-01-10 12:35:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-10 12:35:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-01-10 12:35:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 59 states have internal predecessors, (68), 16 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (19), 16 states have call predecessors, (19), 16 states have call successors, (19) [2022-01-10 12:35:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2022-01-10 12:35:41,281 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 31 [2022-01-10 12:35:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:35:41,281 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2022-01-10 12:35:41,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 12:35:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2022-01-10 12:35:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 12:35:41,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:35:41,283 INFO L514 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] [2022-01-10 12:35:41,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:35:41,284 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 12:35:41,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:35:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash 450464511, now seen corresponding path program 1 times [2022-01-10 12:35:41,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:35:41,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600224150] [2022-01-10 12:35:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:41,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:35:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:41,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 12:35:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 12:35:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:41,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:41,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-10 12:35:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 12:35:41,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:35:41,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600224150] [2022-01-10 12:35:41,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600224150] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:35:41,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117887281] [2022-01-10 12:35:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:41,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:35:41,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:35:41,515 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-01-10 12:35:41,531 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-01-10 12:35:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:41,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 12:35:41,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:35:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 12:35:42,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:35:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 12:35:42,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117887281] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:35:42,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:35:42,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2022-01-10 12:35:42,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965681442] [2022-01-10 12:35:42,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:35:42,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 12:35:42,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:35:42,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 12:35:42,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-01-10 12:35:42,356 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-10 12:35:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:35:44,245 INFO L93 Difference]: Finished difference Result 157 states and 208 transitions. [2022-01-10 12:35:44,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 12:35:44,246 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) Word has length 43 [2022-01-10 12:35:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:35:44,247 INFO L225 Difference]: With dead ends: 157 [2022-01-10 12:35:44,247 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 12:35:44,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-01-10 12:35:44,249 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 119 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-10 12:35:44,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 704 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-10 12:35:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 12:35:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2022-01-10 12:35:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 16 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (21), 16 states have call predecessors, (21), 16 states have call successors, (21) [2022-01-10 12:35:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2022-01-10 12:35:44,257 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 43 [2022-01-10 12:35:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:35:44,257 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2022-01-10 12:35:44,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (15), 4 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2022-01-10 12:35:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2022-01-10 12:35:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 12:35:44,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:35:44,260 INFO L514 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] [2022-01-10 12:35:44,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 12:35:44,475 WARN L452 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-01-10 12:35:44,476 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 12:35:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:35:44,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1332151603, now seen corresponding path program 1 times [2022-01-10 12:35:44,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:35:44,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139538243] [2022-01-10 12:35:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:44,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:35:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 12:35:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 12:35:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 12:35:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 12:35:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-10 12:35:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-01-10 12:35:44,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:35:44,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139538243] [2022-01-10 12:35:44,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139538243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:35:44,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:35:44,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 12:35:44,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137672418] [2022-01-10 12:35:44,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:35:44,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 12:35:44,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:35:44,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 12:35:44,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 12:35:44,758 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 12:35:47,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 12:35:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:35:47,484 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2022-01-10 12:35:47,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 12:35:47,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-01-10 12:35:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:35:47,486 INFO L225 Difference]: With dead ends: 147 [2022-01-10 12:35:47,486 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 12:35:47,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-10 12:35:47,487 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 102 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-01-10 12:35:47,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 407 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-01-10 12:35:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 12:35:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-01-10 12:35:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 63 states have internal predecessors, (70), 16 states have call successors, (16), 5 states have call predecessors, (16), 8 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2022-01-10 12:35:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2022-01-10 12:35:47,512 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 53 [2022-01-10 12:35:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:35:47,512 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2022-01-10 12:35:47,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-10 12:35:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2022-01-10 12:35:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 12:35:47,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:35:47,514 INFO L514 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] [2022-01-10 12:35:47,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 12:35:47,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 12:35:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:35:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1240211948, now seen corresponding path program 1 times [2022-01-10 12:35:47,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:35:47,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745329539] [2022-01-10 12:35:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:47,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:35:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 12:35:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 12:35:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 12:35:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 12:35:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 12:35:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-01-10 12:35:47,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:35:47,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745329539] [2022-01-10 12:35:47,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745329539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:35:47,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:35:47,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-10 12:35:47,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679487546] [2022-01-10 12:35:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:35:47,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 12:35:47,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:35:47,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 12:35:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-10 12:35:47,767 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 12:35:49,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 12:35:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:35:50,394 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2022-01-10 12:35:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 12:35:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 66 [2022-01-10 12:35:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:35:50,396 INFO L225 Difference]: With dead ends: 139 [2022-01-10 12:35:50,396 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 12:35:50,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-10 12:35:50,397 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 115 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-01-10 12:35:50,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 367 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-01-10 12:35:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 12:35:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-01-10 12:35:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 65 states have internal predecessors, (71), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (25), 16 states have call predecessors, (25), 16 states have call successors, (25) [2022-01-10 12:35:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2022-01-10 12:35:50,407 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 66 [2022-01-10 12:35:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:35:50,408 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2022-01-10 12:35:50,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-10 12:35:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2022-01-10 12:35:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-10 12:35:50,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:35:50,410 INFO L514 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] [2022-01-10 12:35:50,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 12:35:50,410 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 12:35:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:35:50,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1600448234, now seen corresponding path program 1 times [2022-01-10 12:35:50,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:35:50,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530788092] [2022-01-10 12:35:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:50,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:35:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 12:35:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 12:35:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 12:35:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 12:35:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 12:35:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 12:35:50,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:35:50,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530788092] [2022-01-10 12:35:50,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530788092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:35:50,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:35:50,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 12:35:50,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422040594] [2022-01-10 12:35:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:35:50,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 12:35:50,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:35:50,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 12:35:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 12:35:50,692 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-10 12:35:52,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 12:35:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:35:52,961 INFO L93 Difference]: Finished difference Result 145 states and 185 transitions. [2022-01-10 12:35:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 12:35:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2022-01-10 12:35:52,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:35:52,964 INFO L225 Difference]: With dead ends: 145 [2022-01-10 12:35:52,964 INFO L226 Difference]: Without dead ends: 90 [2022-01-10 12:35:52,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 12:35:52,965 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 106 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-10 12:35:52,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 204 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-10 12:35:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-10 12:35:52,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-01-10 12:35:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 67 states have internal predecessors, (73), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (25), 16 states have call predecessors, (25), 16 states have call successors, (25) [2022-01-10 12:35:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2022-01-10 12:35:52,979 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 78 [2022-01-10 12:35:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:35:52,979 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2022-01-10 12:35:52,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-10 12:35:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2022-01-10 12:35:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-10 12:35:52,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:35:52,981 INFO L514 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] [2022-01-10 12:35:52,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 12:35:52,981 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 12:35:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:35:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1248662034, now seen corresponding path program 1 times [2022-01-10 12:35:52,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:35:52,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973592442] [2022-01-10 12:35:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:52,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:35:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 12:35:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 12:35:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 12:35:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 12:35:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-10 12:35:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 12:35:53,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:35:53,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973592442] [2022-01-10 12:35:53,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973592442] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:35:53,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569033189] [2022-01-10 12:35:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:53,328 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:35:53,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:35:53,329 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-01-10 12:35:53,330 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-01-10 12:35:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:53,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 12:35:53,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:35:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 12:35:54,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:35:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 12:35:54,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569033189] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:35:54,255 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:35:54,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 4] total 14 [2022-01-10 12:35:54,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709715447] [2022-01-10 12:35:54,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:35:54,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 12:35:54,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:35:54,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 12:35:54,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-10 12:35:54,257 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-10 12:35:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:35:58,141 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2022-01-10 12:35:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 12:35:58,142 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 79 [2022-01-10 12:35:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:35:58,143 INFO L225 Difference]: With dead ends: 149 [2022-01-10 12:35:58,144 INFO L226 Difference]: Without dead ends: 93 [2022-01-10 12:35:58,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-01-10 12:35:58,145 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 50 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-10 12:35:58,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 483 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 360 Invalid, 0 Unknown, 53 Unchecked, 1.7s Time] [2022-01-10 12:35:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-10 12:35:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-01-10 12:35:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 70 states have internal predecessors, (76), 16 states have call successors, (16), 5 states have call predecessors, (16), 9 states have return successors, (25), 16 states have call predecessors, (25), 16 states have call successors, (25) [2022-01-10 12:35:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2022-01-10 12:35:58,162 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 79 [2022-01-10 12:35:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:35:58,162 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2022-01-10 12:35:58,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 12 states have internal predecessors, (56), 2 states have call successors, (21), 4 states have call predecessors, (21), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-10 12:35:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2022-01-10 12:35:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 12:35:58,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:35:58,163 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-10 12:35:58,180 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-01-10 12:35:58,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 12:35:58,378 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 12:35:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:35:58,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1477567122, now seen corresponding path program 2 times [2022-01-10 12:35:58,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:35:58,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472093344] [2022-01-10 12:35:58,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:35:58,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:35:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 12:35:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-10 12:35:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-10 12:35:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-10 12:35:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-10 12:35:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:35:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:35:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:35:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 12:35:58,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:35:58,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472093344] [2022-01-10 12:35:58,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472093344] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:35:58,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587672755] [2022-01-10 12:35:58,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 12:35:58,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:35:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:35:58,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:35:58,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 12:36:02,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 12:36:02,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:36:02,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-10 12:36:02,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:36:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-10 12:36:03,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:36:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-01-10 12:36:03,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587672755] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:36:03,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:36:03,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 8] total 31 [2022-01-10 12:36:03,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704959763] [2022-01-10 12:36:03,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:36:03,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-10 12:36:03,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:36:03,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-10 12:36:03,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2022-01-10 12:36:03,622 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 26 states have internal predecessors, (79), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 7 states have call successors, (25) [2022-01-10 12:36:07,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 12:36:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:36:09,162 INFO L93 Difference]: Finished difference Result 219 states and 286 transitions. [2022-01-10 12:36:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-10 12:36:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 26 states have internal predecessors, (79), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 7 states have call successors, (25) Word has length 81 [2022-01-10 12:36:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:36:09,164 INFO L225 Difference]: With dead ends: 219 [2022-01-10 12:36:09,164 INFO L226 Difference]: Without dead ends: 162 [2022-01-10 12:36:09,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=478, Invalid=2828, Unknown=0, NotChecked=0, Total=3306 [2022-01-10 12:36:09,166 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 438 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 316 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:36:09,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 897 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1170 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-01-10 12:36:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-01-10 12:36:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 108. [2022-01-10 12:36:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 83 states have internal predecessors, (91), 17 states have call successors, (17), 5 states have call predecessors, (17), 10 states have return successors, (32), 19 states have call predecessors, (32), 17 states have call successors, (32) [2022-01-10 12:36:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 140 transitions. [2022-01-10 12:36:09,188 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 140 transitions. Word has length 81 [2022-01-10 12:36:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:36:09,188 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 140 transitions. [2022-01-10 12:36:09,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 26 states have internal predecessors, (79), 7 states have call successors, (26), 4 states have call predecessors, (26), 6 states have return successors, (25), 9 states have call predecessors, (25), 7 states have call successors, (25) [2022-01-10 12:36:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 140 transitions. [2022-01-10 12:36:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-10 12:36:09,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:36:09,189 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2022-01-10 12:36:09,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 12:36:09,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:36:09,404 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 12:36:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:36:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2117109738, now seen corresponding path program 3 times [2022-01-10 12:36:09,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:36:09,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390692118] [2022-01-10 12:36:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:36:09,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:36:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 12:36:09,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 12:36:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 12:36:10,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 12:36:10,347 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 12:36:10,348 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-10 12:36:10,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-10 12:36:10,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-10 12:36:10,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-10 12:36:10,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 12:36:10,353 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-01-10 12:36:10,355 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 12:36:10,405 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,406 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,408 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,411 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,411 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,411 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,411 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,411 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,412 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,412 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,412 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-10 12:36:10,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:36:10 BasicIcfg [2022-01-10 12:36:10,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 12:36:10,444 INFO L158 Benchmark]: Toolchain (without parser) took 33512.51ms. Allocated memory was 174.1MB in the beginning and 278.9MB in the end (delta: 104.9MB). Free memory was 117.7MB in the beginning and 105.8MB in the end (delta: 11.9MB). Peak memory consumption was 141.1MB. Max. memory is 8.0GB. [2022-01-10 12:36:10,445 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 12:36:10,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.55ms. Allocated memory was 174.1MB in the beginning and 231.7MB in the end (delta: 57.7MB). Free memory was 117.6MB in the beginning and 199.9MB in the end (delta: -82.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 12:36:10,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.94ms. Allocated memory is still 231.7MB. Free memory was 199.9MB in the beginning and 198.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 12:36:10,445 INFO L158 Benchmark]: Boogie Preprocessor took 57.68ms. Allocated memory is still 231.7MB. Free memory was 198.3MB in the beginning and 196.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 12:36:10,446 INFO L158 Benchmark]: RCFGBuilder took 451.36ms. Allocated memory is still 231.7MB. Free memory was 196.2MB in the beginning and 174.2MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-01-10 12:36:10,446 INFO L158 Benchmark]: IcfgTransformer took 169.25ms. Allocated memory is still 231.7MB. Free memory was 174.2MB in the beginning and 162.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-10 12:36:10,446 INFO L158 Benchmark]: TraceAbstraction took 32472.31ms. Allocated memory was 231.7MB in the beginning and 278.9MB in the end (delta: 47.2MB). Free memory was 161.6MB in the beginning and 105.8MB in the end (delta: 55.8MB). Peak memory consumption was 126.6MB. Max. memory is 8.0GB. [2022-01-10 12:36:10,447 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 174.1MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.55ms. Allocated memory was 174.1MB in the beginning and 231.7MB in the end (delta: 57.7MB). Free memory was 117.6MB in the beginning and 199.9MB in the end (delta: -82.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.94ms. Allocated memory is still 231.7MB. Free memory was 199.9MB in the beginning and 198.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.68ms. Allocated memory is still 231.7MB. Free memory was 198.3MB in the beginning and 196.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 451.36ms. Allocated memory is still 231.7MB. Free memory was 196.2MB in the beginning and 174.2MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * IcfgTransformer took 169.25ms. Allocated memory is still 231.7MB. Free memory was 174.2MB in the beginning and 162.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 32472.31ms. Allocated memory was 231.7MB in the beginning and 278.9MB in the end (delta: 47.2MB). Free memory was 161.6MB in the beginning and 105.8MB in the end (delta: 55.8MB). Peak memory consumption was 126.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * 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: [L102] 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={-15: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={-15:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-15:0}, n={-15:0}] [L102] RET, EXPR nondet_tree() VAL [nondet_tree()={-15:0}] [L102] CALL task(nondet_tree()) [L78] CALL, EXPR min(t) VAL [n={-15:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-15:0}, n={-15:0}, n->left={0:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=-1, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=-1, n={-15:0}, n={-15:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-15:0}, n={-15:0}, n->right={0:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=-1, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=-1, n={-15:0}, n={-15:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=-1, a=2147483647, b=2147483647, c=2147483647, n={-15:0}, n={-15:0}] [L78] RET, EXPR min(t) VAL [min(t)=-1, t={-15:0}, t={-15:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={-8:0}, t={-15:0}, t={-15:0}] [L81] CALL, EXPR size(t) VAL [t={-15:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={-15:0}, t={-15:0}, t->left={0:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-15:0}, t={-15:0}, t->left={0:0}] [L74] EXPR t->right VAL [size(t->left)=0, t={-15:0}, t={-15:0}, t->left={0:0}, t->right={0:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-15:0}, t={-15:0}, t->left={0:0}, t->right={0:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={-8:0}, size(t)=-1, t={-15:0}, t={-15:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume_cycle_if_not(n != 0) [L83] EXPR, FCALL calloc(n, sizeof(int)) [L83] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={-8:0}, calloc(n, sizeof(int))={-6:0}, n=1, t={-15:0}, t={-15:0}, x={-6:0}] [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-6:0}, t={-15:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(i)=1, a={-6:0}, a={-6:0}, i=1, t={-15:0}, t={-15:0}, t->left={0:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-6:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=-1, a={-6:0}, a={-6:0}, i=1, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-6:0}, a={-6:0}, i=1, t={-15:0}, t={-15:0}, t->left={0:0}, tree_inorder(t->left, a, i)=-1] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(i)=1, a={-6:0}, a={-6:0}, i=2, t={-15:0}, t={-15:0}, t->right={0:0}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-6:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=-2, a={-6:0}, a={-6:0}, i=2, t={0:0}, t={0:0}] [L67] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-6:0}, a={-6:0}, i=2, t={-15:0}, t={-15:0}, t->right={0:0}, tree_inorder(t->right, a, i)=-2] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=-2, a={-6:0}, a={-6:0}, i=2, t={-15:0}, t={-15:0}] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={-8:0}, calloc(n, sizeof(int))={-6:0}, n=1, t={-15:0}, t={-15:0}, tree_inorder(t, x, n)=-2, x={-6:0}] [L85] EXPR x[0] [L85] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 85 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 32.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 994 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 957 mSDsluCounter, 3402 SdHoareTripleChecker+Invalid, 17.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 2831 mSDsCounter, 577 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3101 IncrementalHoareTripleChecker+Invalid, 3733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 577 mSolverCounterUnsat, 571 mSDtfsCounter, 3101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 496 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=7, InterpolantAutomatonStates: 85, 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, 7 MinimizatonAttempts, 70 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 824 ConstructedInterpolants, 2 QuantifiedInterpolants, 3171 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2782 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 393/426 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-01-10 12:36:10,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...