/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_NONE.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:15:29,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:15:29,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:15:29,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:15:29,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:15:29,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:15:29,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:15:29,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:15:29,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:15:29,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:15:29,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:15:29,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:15:29,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:15:29,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:15:29,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:15:29,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:15:29,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:15:29,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:15:29,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:15:29,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:15:29,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:15:29,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:15:29,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:15:29,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:15:29,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:15:29,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:15:29,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:15:29,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:15:29,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:15:29,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:15:29,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:15:29,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:15:29,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:15:29,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:15:29,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:15:29,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:15:29,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:15:29,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:15:29,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:15:29,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:15:29,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:15:29,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:15:29,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:15:29,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:15:29,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:15:29,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:15:29,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:15:29,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:15:29,687 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:15:29,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:15:29,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:15:29,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:15:29,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:15:29,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:15:29,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:15:29,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:15:29,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:15:29,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:15:29,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:15:29,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:15:29,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:15:29,690 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:15:29,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:15:29,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:15:29,690 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:15:29,691 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:15:29,692 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:15:29,692 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-11 00:15:29,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:15:29,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:15:29,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:15:29,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:15:29,862 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:15:29,863 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2022-01-11 00:15:29,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29a5c74e/7e06b9929406415bbcd1bd1fcb96f6c2/FLAG1a3dde96a [2022-01-11 00:15:30,253 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:15:30,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2022-01-11 00:15:30,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29a5c74e/7e06b9929406415bbcd1bd1fcb96f6c2/FLAG1a3dde96a [2022-01-11 00:15:30,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f29a5c74e/7e06b9929406415bbcd1bd1fcb96f6c2 [2022-01-11 00:15:30,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:15:30,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:15:30,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:15:30,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:15:30,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:15:30,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7fe709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30, skipping insertion in model container [2022-01-11 00:15:30,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:15:30,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:15:30,435 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_incorrect.c[618,631] [2022-01-11 00:15:30,443 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 00:15:30,444 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 00:15:30,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:15:30,467 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-11 00:15:30,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:15:30,476 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_incorrect.c[618,631] [2022-01-11 00:15:30,479 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 00:15:30,480 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 00:15:30,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:15:30,494 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:15:30,505 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_incorrect.c[618,631] [2022-01-11 00:15:30,509 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 00:15:30,510 WARN L1533 CHandler]: Possible shadowing of function min [2022-01-11 00:15:30,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:15:30,525 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:15:30,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30 WrapperNode [2022-01-11 00:15:30,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:15:30,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:15:30,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:15:30,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:15:30,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,551 INFO L137 Inliner]: procedures = 31, calls = 58, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 90 [2022-01-11 00:15:30,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:15:30,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:15:30,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:15:30,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:15:30,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:15:30,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:15:30,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:15:30,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:15:30,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (1/1) ... [2022-01-11 00:15:30,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:15:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:15:30,602 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-11 00:15:30,606 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-11 00:15:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:15:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:15:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-11 00:15:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 00:15:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2022-01-11 00:15:30,626 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2022-01-11 00:15:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure min [2022-01-11 00:15:30,626 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2022-01-11 00:15:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 00:15:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 00:15:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2022-01-11 00:15:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2022-01-11 00:15:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 00:15:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure size [2022-01-11 00:15:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2022-01-11 00:15:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:15:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:15:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2022-01-11 00:15:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2022-01-11 00:15:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 00:15:30,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 00:15:30,716 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:15:30,717 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:15:31,054 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:15:31,059 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:15:31,059 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 00:15:31,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:15:31 BoogieIcfgContainer [2022-01-11 00:15:31,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:15:31,061 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:15:31,061 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:15:31,061 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:15:31,063 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:15:31" (1/1) ... [2022-01-11 00:15:31,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:15:31 BasicIcfg [2022-01-11 00:15:31,192 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:15:31,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:15:31,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:15:31,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:15:31,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:15:30" (1/4) ... [2022-01-11 00:15:31,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b424d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:15:31, skipping insertion in model container [2022-01-11 00:15:31,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:15:30" (2/4) ... [2022-01-11 00:15:31,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b424d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:15:31, skipping insertion in model container [2022-01-11 00:15:31,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:15:31" (3/4) ... [2022-01-11 00:15:31,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b424d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:15:31, skipping insertion in model container [2022-01-11 00:15:31,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:15:31" (4/4) ... [2022-01-11 00:15:31,201 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.cTransformedIcfg [2022-01-11 00:15:31,204 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:15:31,205 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 00:15:31,253 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:15:31,257 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-11 00:15:31,258 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 00:15:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 61 states have internal predecessors, (76), 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-11 00:15:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 00:15:31,275 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:31,275 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-11 00:15:31,276 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-11 00:15:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash -438391456, now seen corresponding path program 1 times [2022-01-11 00:15:31,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:31,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911763960] [2022-01-11 00:15:31,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:31,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:31,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-11 00:15:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:31,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-11 00:15:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-11 00:15:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:31,583 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-11 00:15:31,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:31,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911763960] [2022-01-11 00:15:31,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911763960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:15:31,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:15:31,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:15:31,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935289432] [2022-01-11 00:15:31,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:15:31,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:15:31,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:31,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:15:31,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:15:31,616 INFO L87 Difference]: Start difference. First operand has 83 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 61 states have internal predecessors, (76), 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 4 states, 4 states have (on average 5.75) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-11 00:15:33,856 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-11 00:15:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:15:33,915 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2022-01-11 00:15:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:15:33,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-01-11 00:15:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:15:33,924 INFO L225 Difference]: With dead ends: 146 [2022-01-11 00:15:33,924 INFO L226 Difference]: Without dead ends: 83 [2022-01-11 00:15:33,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:15:33,928 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 44 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:15:33,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 126 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-11 00:15:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-11 00:15:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2022-01-11 00:15:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 56 states have internal predecessors, (65), 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-11 00:15:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2022-01-11 00:15:33,972 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 31 [2022-01-11 00:15:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:15:33,973 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2022-01-11 00:15:33,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-11 00:15:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2022-01-11 00:15:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-11 00:15:33,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:33,977 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-11 00:15:33,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:15:33,977 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-11 00:15:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash -309308737, now seen corresponding path program 1 times [2022-01-11 00:15:33,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:33,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823065257] [2022-01-11 00:15:33,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:33,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:34,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-11 00:15:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-11 00:15:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-11 00:15:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:34,188 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-11 00:15:34,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:34,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823065257] [2022-01-11 00:15:34,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823065257] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:15:34,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:15:34,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 00:15:34,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124544941] [2022-01-11 00:15:34,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:15:34,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 00:15:34,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:34,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 00:15:34,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:15:34,194 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. 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-11 00:15:36,487 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-11 00:15:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:15:36,552 INFO L93 Difference]: Finished difference Result 140 states and 178 transitions. [2022-01-11 00:15:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:15:36,552 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-11 00:15:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:15:36,554 INFO L225 Difference]: With dead ends: 140 [2022-01-11 00:15:36,554 INFO L226 Difference]: Without dead ends: 85 [2022-01-11 00:15:36,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-11 00:15:36,555 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 23 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:15:36,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 304 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-01-11 00:15:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-11 00:15:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-01-11 00:15:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 58 states have internal predecessors, (66), 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-11 00:15:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2022-01-11 00:15:36,564 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 31 [2022-01-11 00:15:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:15:36,564 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2022-01-11 00:15:36,564 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-11 00:15:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2022-01-11 00:15:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 00:15:36,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:36,565 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-11 00:15:36,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:15:36,565 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-11 00:15:36,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1624221940, now seen corresponding path program 1 times [2022-01-11 00:15:36,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:36,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541779021] [2022-01-11 00:15:36,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:36,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:36,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-11 00:15:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-11 00:15:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:36,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-11 00:15:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:36,739 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-11 00:15:36,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:36,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541779021] [2022-01-11 00:15:36,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541779021] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:15:36,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109889299] [2022-01-11 00:15:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:36,740 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:15:36,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:15:36,741 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-11 00:15:36,742 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-11 00:15:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:36,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-11 00:15:36,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:15:37,098 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-11 00:15:37,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:15:37,471 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-11 00:15:37,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109889299] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:15:37,472 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:15:37,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2022-01-11 00:15:37,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542373262] [2022-01-11 00:15:37,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:15:37,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-11 00:15:37,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:37,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-11 00:15:37,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-01-11 00:15:37,473 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (15), 10 states have call predecessors, (15), 8 states have call successors, (15) [2022-01-11 00:15:40,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 00:15:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:15:41,484 INFO L93 Difference]: Finished difference Result 157 states and 207 transitions. [2022-01-11 00:15:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 00:15:41,484 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (15), 10 states have call predecessors, (15), 8 states have call successors, (15) Word has length 43 [2022-01-11 00:15:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:15:41,486 INFO L225 Difference]: With dead ends: 157 [2022-01-11 00:15:41,486 INFO L226 Difference]: Without dead ends: 87 [2022-01-11 00:15:41,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-01-11 00:15:41,488 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 72 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-01-11 00:15:41,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 620 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-01-11 00:15:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-11 00:15:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-01-11 00:15:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 62 states have internal predecessors, (68), 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-11 00:15:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-01-11 00:15:41,496 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 43 [2022-01-11 00:15:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:15:41,496 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-01-11 00:15:41,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 15 states have internal predecessors, (50), 8 states have call successors, (15), 4 states have call predecessors, (15), 7 states have return successors, (15), 10 states have call predecessors, (15), 8 states have call successors, (15) [2022-01-11 00:15:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-01-11 00:15:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 00:15:41,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:41,497 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-11 00:15:41,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 00:15:41,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:15:41,730 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-11 00:15:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:41,730 INFO L85 PathProgramCache]: Analyzing trace with hash 708678580, now seen corresponding path program 1 times [2022-01-11 00:15:41,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:41,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080934441] [2022-01-11 00:15:41,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:41,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 00:15:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 00:15:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 00:15:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-11 00:15:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-11 00:15:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:41,919 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-11 00:15:41,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:41,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080934441] [2022-01-11 00:15:41,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080934441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:15:41,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:15:41,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-11 00:15:41,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071082494] [2022-01-11 00:15:41,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:15:41,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 00:15:41,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:41,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 00:15:41,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-11 00:15:41,921 INFO L87 Difference]: Start difference. First operand 84 states and 107 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-11 00:15:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:15:43,079 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2022-01-11 00:15:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 00:15:43,080 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-11 00:15:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:15:43,081 INFO L225 Difference]: With dead ends: 138 [2022-01-11 00:15:43,081 INFO L226 Difference]: Without dead ends: 87 [2022-01-11 00:15:43,082 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-11 00:15:43,083 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 89 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:15:43,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 395 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-11 00:15:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-11 00:15:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-01-11 00:15:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 64 states have internal predecessors, (69), 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-11 00:15:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2022-01-11 00:15:43,089 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 66 [2022-01-11 00:15:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:15:43,090 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2022-01-11 00:15:43,090 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-11 00:15:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2022-01-11 00:15:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-11 00:15:43,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:43,092 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-11 00:15:43,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:15:43,092 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-11 00:15:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1370724578, now seen corresponding path program 1 times [2022-01-11 00:15:43,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:43,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237946315] [2022-01-11 00:15:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:43,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 00:15:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 00:15:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 00:15:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-11 00:15:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-11 00:15:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:43,392 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-11 00:15:43,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:43,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237946315] [2022-01-11 00:15:43,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237946315] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:15:43,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:15:43,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 00:15:43,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288183315] [2022-01-11 00:15:43,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:15:43,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 00:15:43,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:43,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 00:15:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:15:43,394 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) 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), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-11 00:15:45,839 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-11 00:15:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:15:46,187 INFO L93 Difference]: Finished difference Result 144 states and 183 transitions. [2022-01-11 00:15:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:15:46,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) 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), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2022-01-11 00:15:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:15:46,190 INFO L225 Difference]: With dead ends: 144 [2022-01-11 00:15:46,190 INFO L226 Difference]: Without dead ends: 89 [2022-01-11 00:15:46,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:15:46,193 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 101 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-11 00:15:46,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 177 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 134 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-01-11 00:15:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-11 00:15:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-01-11 00:15:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 66 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-11 00:15:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2022-01-11 00:15:46,202 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 78 [2022-01-11 00:15:46,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:15:46,202 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2022-01-11 00:15:46,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) 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), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-11 00:15:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2022-01-11 00:15:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-11 00:15:46,204 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:46,204 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-11 00:15:46,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:15:46,204 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-11 00:15:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:46,207 INFO L85 PathProgramCache]: Analyzing trace with hash 202862583, now seen corresponding path program 1 times [2022-01-11 00:15:46,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:46,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877946152] [2022-01-11 00:15:46,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:46,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 00:15:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 00:15:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 00:15:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-11 00:15:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-11 00:15:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,544 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-11 00:15:46,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:46,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877946152] [2022-01-11 00:15:46,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877946152] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:15:46,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302618492] [2022-01-11 00:15:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:46,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:15:46,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:15:46,546 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-11 00:15:46,559 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-11 00:15:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:46,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-11 00:15:46,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:15:47,413 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-11 00:15:47,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:15:47,615 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-11 00:15:47,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302618492] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:15:47,615 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:15:47,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 4] total 14 [2022-01-11 00:15:47,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543135315] [2022-01-11 00:15:47,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:15:47,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-11 00:15:47,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:47,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-11 00:15:47,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-11 00:15:47,616 INFO L87 Difference]: Start difference. First operand 88 states and 112 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-11 00:15:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:15:49,406 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2022-01-11 00:15:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 00:15:49,406 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-11 00:15:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:15:49,407 INFO L225 Difference]: With dead ends: 147 [2022-01-11 00:15:49,407 INFO L226 Difference]: Without dead ends: 91 [2022-01-11 00:15:49,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-01-11 00:15:49,408 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 49 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:15:49,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 433 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 349 Invalid, 0 Unknown, 4 Unchecked, 1.3s Time] [2022-01-11 00:15:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-11 00:15:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2022-01-11 00:15:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 68 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-11 00:15:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2022-01-11 00:15:49,418 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 79 [2022-01-11 00:15:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:15:49,420 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2022-01-11 00:15:49,420 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-11 00:15:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-01-11 00:15:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-11 00:15:49,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:15:49,427 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:15:49,464 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-11 00:15:49,628 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-11 00:15:49,628 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-11 00:15:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:15:49,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1739424318, now seen corresponding path program 2 times [2022-01-11 00:15:49,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:15:49,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38985255] [2022-01-11 00:15:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:15:49,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:15:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-11 00:15:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-11 00:15:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-11 00:15:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-11 00:15:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-11 00:15:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-11 00:15:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-11 00:15:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:15:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-11 00:15:49,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:15:49,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38985255] [2022-01-11 00:15:49,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38985255] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 00:15:49,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122262182] [2022-01-11 00:15:49,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 00:15:49,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 00:15:49,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:15:49,936 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-11 00:15:49,937 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-11 00:15:54,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 00:15:54,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 00:15:54,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-11 00:15:54,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 00:15:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-01-11 00:15:58,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 00:15:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-01-11 00:15:59,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122262182] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 00:15:59,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 00:15:59,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 26 [2022-01-11 00:15:59,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984467338] [2022-01-11 00:15:59,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 00:15:59,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-11 00:15:59,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:15:59,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-11 00:15:59,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2022-01-11 00:15:59,550 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 22 states have internal predecessors, (72), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-01-11 00:16:10,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 00:16:12,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-11 00:16:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:16:12,890 INFO L93 Difference]: Finished difference Result 168 states and 217 transitions. [2022-01-11 00:16:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-11 00:16:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 22 states have internal predecessors, (72), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 80 [2022-01-11 00:16:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:16:12,892 INFO L225 Difference]: With dead ends: 168 [2022-01-11 00:16:12,892 INFO L226 Difference]: Without dead ends: 106 [2022-01-11 00:16:12,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=218, Invalid=1261, Unknown=3, NotChecked=0, Total=1482 [2022-01-11 00:16:12,893 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 97 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 106 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:16:12,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 699 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 866 Invalid, 1 Unknown, 7 Unchecked, 4.3s Time] [2022-01-11 00:16:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-01-11 00:16:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2022-01-11 00:16:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.1875) internal successors, (76), 71 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-11 00:16:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2022-01-11 00:16:12,904 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 80 [2022-01-11 00:16:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:16:12,904 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2022-01-11 00:16:12,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 22 states have internal predecessors, (72), 6 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-01-11 00:16:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2022-01-11 00:16:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-11 00:16:12,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:16:12,905 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-11 00:16:12,920 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-11 00:16:13,111 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-11 00:16:13,112 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-11 00:16:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:16:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1295275358, now seen corresponding path program 3 times [2022-01-11 00:16:13,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:16:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541548569] [2022-01-11 00:16:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:16:13,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:16:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 00:16:13,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 00:16:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 00:16:14,188 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 00:16:14,188 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 00:16:14,189 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-11 00:16:14,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-11 00:16:14,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-11 00:16:14,190 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-11 00:16:14,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:16:14,195 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-01-11 00:16:14,198 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 00:16:14,253 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,254 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,256 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,256 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,256 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,258 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,259 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-01-11 00:16:14,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:16:14 BasicIcfg [2022-01-11 00:16:14,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 00:16:14,299 INFO L158 Benchmark]: Toolchain (without parser) took 44014.40ms. Allocated memory was 204.5MB in the beginning and 299.9MB in the end (delta: 95.4MB). Free memory was 180.5MB in the beginning and 163.5MB in the end (delta: 17.1MB). Peak memory consumption was 178.3MB. Max. memory is 8.0GB. [2022-01-11 00:16:14,299 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 00:16:14,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.26ms. Allocated memory is still 204.5MB. Free memory was 180.3MB in the beginning and 174.7MB in the end (delta: 5.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-01-11 00:16:14,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.53ms. Allocated memory is still 204.5MB. Free memory was 174.7MB in the beginning and 172.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 00:16:14,300 INFO L158 Benchmark]: Boogie Preprocessor took 24.72ms. Allocated memory is still 204.5MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 00:16:14,300 INFO L158 Benchmark]: RCFGBuilder took 482.80ms. Allocated memory is still 204.5MB. Free memory was 170.2MB in the beginning and 149.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-01-11 00:16:14,300 INFO L158 Benchmark]: IcfgTransformer took 131.71ms. Allocated memory is still 204.5MB. Free memory was 149.5MB in the beginning and 138.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-11 00:16:14,300 INFO L158 Benchmark]: TraceAbstraction took 43104.83ms. Allocated memory was 204.5MB in the beginning and 299.9MB in the end (delta: 95.4MB). Free memory was 137.7MB in the beginning and 163.5MB in the end (delta: -25.8MB). Peak memory consumption was 135.6MB. Max. memory is 8.0GB. [2022-01-11 00:16:14,302 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 204.5MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.26ms. Allocated memory is still 204.5MB. Free memory was 180.3MB in the beginning and 174.7MB in the end (delta: 5.7MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.53ms. Allocated memory is still 204.5MB. Free memory was 174.7MB in the beginning and 172.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.72ms. Allocated memory is still 204.5MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 482.80ms. Allocated memory is still 204.5MB. Free memory was 170.2MB in the beginning and 149.8MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * IcfgTransformer took 131.71ms. Allocated memory is still 204.5MB. Free memory was 149.5MB in the beginning and 138.3MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 43104.83ms. Allocated memory was 204.5MB in the beginning and 299.9MB in the end (delta: 95.4MB). Free memory was 137.7MB in the beginning and 163.5MB in the end (delta: -25.8MB). Peak memory consumption was 135.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: [L98] 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={-7: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={-7:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-7:0}, n={-7:0}] [L98] RET, EXPR nondet_tree() VAL [nondet_tree()={-7:0}] [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [n={-7:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-7:0}, n={-7:0}, n->left={0:0}] [L40] 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}] [L40] RET, EXPR min(n->left) VAL [min(n->left)=-1, n={-7:0}, n={-7:0}, n->left={0:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-7:0}, n={-7:0}, n->right={0:0}] [L41] 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}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, min(n->right)=-1, n={-7:0}, n={-7:0}, n->right={0:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=-1, a=2147483647, b=2147483647, n={-7:0}, n={-7:0}] [L76] RET, EXPR min(t) VAL [min(t)=-1, t={-7:0}, t={-7:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={-5:0}, t={-7:0}, t={-7:0}] [L79] CALL, EXPR size(t) VAL [t={-7:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-7:0}, t={-7:0}, t->left={0:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-7:0}, t={-7:0}, t->left={0:0}] [L72] EXPR t->right VAL [size(t->left)=0, t={-7:0}, t={-7:0}, t->left={0:0}, t->right={0:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-7:0}, t={-7:0}, t->left={0:0}, t->right={0:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={-5:0}, size(t)=-1, t={-7:0}, t={-7:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) [L81] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={-5:0}, calloc(n, sizeof(int))={-8:0}, n=1, t={-7:0}, t={-7:0}, x={-8:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-8:0}, t={-7:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={-8:0}, a={-8:0}, i=1, t={-7:0}, t={-7:0}, t->left={0:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-8:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=-1, a={-8:0}, a={-8:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-8:0}, a={-8:0}, i=1, t={-7:0}, t={-7:0}, t->left={0:0}, tree_inorder(t->left, a, i)=-1] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={-8:0}, a={-8:0}, i=2, t={-7:0}, t={-7:0}, t->right={0:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-8:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=-2, a={-8:0}, a={-8:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-8:0}, a={-8:0}, i=2, t={-7:0}, t={-7:0}, t->right={0:0}, tree_inorder(t->right, a, i)=-2] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=-2, a={-8:0}, a={-8:0}, i=2, t={-7:0}, t={-7:0}] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={-5:0}, calloc(n, sizeof(int))={-8:0}, n=1, t={-7:0}, t={-7:0}, tree_inorder(t, x, n)=-2, x={-8:0}] [L83] EXPR x[0] [L83] 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, 83 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 42.9s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 520 SdHoareTripleChecker+Valid, 17.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 2754 SdHoareTripleChecker+Invalid, 17.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 2208 mSDsCounter, 315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2403 IncrementalHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 315 mSolverCounterUnsat, 546 mSDtfsCounter, 2403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 489 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, InterpolantAutomatonStates: 70, 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, 29 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 799 ConstructedInterpolants, 3 QuantifiedInterpolants, 2927 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2739 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 370/396 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-11 00:16:14,348 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...