/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:32:55,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:32:55,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:32:55,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:32:55,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:32:55,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:32:55,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:32:55,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:32:55,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:32:55,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:32:55,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:32:55,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:32:55,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:32:55,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:32:55,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:32:55,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:32:55,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:32:55,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:32:55,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:32:55,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:32:55,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:32:55,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:32:55,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:32:55,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:32:55,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:32:55,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:32:55,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:32:55,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:32:55,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:32:55,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:32:55,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:32:55,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:32:55,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:32:55,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:32:55,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:32:55,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:32:55,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:32:55,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:32:55,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:32:55,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:32:55,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:32:55,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:32:55,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:32:55,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:32:55,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:32:55,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:32:55,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:32:55,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:32:55,816 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:32:55,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:32:55,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:32:55,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:32:55,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:32:55,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:32:55,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:32:55,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:32:55,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:32:55,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:32:55,820 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:32:55,820 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 12:32:56,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:32:56,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:32:56,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:32:56,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:32:56,034 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:32:56,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-2.c [2022-01-10 12:32:56,091 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af8f4f47/d26fc67a40cd473ca247033d038c84cf/FLAG9a0574041 [2022-01-10 12:32:56,449 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:32:56,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-2.c [2022-01-10 12:32:56,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af8f4f47/d26fc67a40cd473ca247033d038c84cf/FLAG9a0574041 [2022-01-10 12:32:56,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5af8f4f47/d26fc67a40cd473ca247033d038c84cf [2022-01-10 12:32:56,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:32:56,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:32:56,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:32:56,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:32:56,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:32:56,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:32:56" (1/1) ... [2022-01-10 12:32:56,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30870a4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:56, skipping insertion in model container [2022-01-10 12:32:56,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:32:56" (1/1) ... [2022-01-10 12:32:56,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:32:56,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:32:57,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-2.c[740,753] [2022-01-10 12:32:57,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:32:57,040 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:32:57,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-2.c[740,753] [2022-01-10 12:32:57,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:32:57,058 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:32:57,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57 WrapperNode [2022-01-10 12:32:57,059 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:32:57,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:32:57,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:32:57,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:32:57,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,080 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-01-10 12:32:57,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:32:57,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:32:57,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:32:57,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:32:57,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:32:57,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:32:57,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:32:57,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:32:57,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:32:57,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:32:57,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 12:32:57,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 12:32:57,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:32:57,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:32:57,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:32:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:32:57,147 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-01-10 12:32:57,147 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-01-10 12:32:57,189 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:32:57,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:32:57,262 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:32:57,265 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:32:57,266 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 12:32:57,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:32:57 BoogieIcfgContainer [2022-01-10 12:32:57,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:32:57,267 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:32:57,268 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:32:57,270 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:32:57,272 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:32:57" (1/1) ... [2022-01-10 12:32:57,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:32:57 BasicIcfg [2022-01-10 12:32:57,338 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:32:57,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:32:57,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:32:57,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:32:57,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:32:56" (1/4) ... [2022-01-10 12:32:57,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5c5e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:32:57, skipping insertion in model container [2022-01-10 12:32:57,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:32:57" (2/4) ... [2022-01-10 12:32:57,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5c5e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:32:57, skipping insertion in model container [2022-01-10 12:32:57,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:32:57" (3/4) ... [2022-01-10 12:32:57,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5c5e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:32:57, skipping insertion in model container [2022-01-10 12:32:57,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:32:57" (4/4) ... [2022-01-10 12:32:57,343 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_5-2.cTransformedIcfg [2022-01-10 12:32:57,347 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:32:57,347 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 12:32:57,400 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:32:57,408 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 12:32:57,409 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 12:32:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 12:32:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 12:32:57,428 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:32:57,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:32:57,429 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:32:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:32:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2142902620, now seen corresponding path program 1 times [2022-01-10 12:32:57,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:32:57,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367951228] [2022-01-10 12:32:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:32:57,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:32:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:32:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:32:57,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:32:57,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367951228] [2022-01-10 12:32:57,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367951228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:32:57,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:32:57,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:32:57,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822865229] [2022-01-10 12:32:57,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:32:57,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:32:57,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:32:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:32:57,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:32:57,667 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 12:32:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:32:57,696 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-01-10 12:32:57,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:32:57,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-01-10 12:32:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:32:57,703 INFO L225 Difference]: With dead ends: 33 [2022-01-10 12:32:57,703 INFO L226 Difference]: Without dead ends: 17 [2022-01-10 12:32:57,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:32:57,707 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:32:57,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:32:57,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-10 12:32:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-10 12:32:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 12:32:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-10 12:32:57,740 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2022-01-10 12:32:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:32:57,741 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-10 12:32:57,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 12:32:57,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-10 12:32:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 12:32:57,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:32:57,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:32:57,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:32:57,742 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:32:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:32:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1380246405, now seen corresponding path program 1 times [2022-01-10 12:32:57,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:32:57,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233171694] [2022-01-10 12:32:57,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:32:57,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:32:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:57,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:32:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:32:57,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:32:57,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233171694] [2022-01-10 12:32:57,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233171694] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:32:57,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:32:57,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:32:57,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232449911] [2022-01-10 12:32:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:32:57,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:32:57,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:32:57,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:32:57,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:32:57,844 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 12:32:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:32:57,891 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-01-10 12:32:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:32:57,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-01-10 12:32:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:32:57,892 INFO L225 Difference]: With dead ends: 23 [2022-01-10 12:32:57,892 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 12:32:57,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:32:57,894 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:32:57,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 30 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:32:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 12:32:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-01-10 12:32:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 12:32:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-10 12:32:57,899 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2022-01-10 12:32:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:32:57,899 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-10 12:32:57,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 12:32:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-10 12:32:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 12:32:57,900 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:32:57,900 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:32:57,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 12:32:57,901 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:32:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:32:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash -794894887, now seen corresponding path program 1 times [2022-01-10 12:32:57,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:32:57,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895810594] [2022-01-10 12:32:57,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:32:57,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:32:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:57,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:32:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:32:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:32:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:32:58,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:32:58,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895810594] [2022-01-10 12:32:58,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895810594] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:32:58,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911945037] [2022-01-10 12:32:58,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:32:58,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:32:58,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:32:58,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:32:58,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 12:32:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 12:32:58,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:32:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 12:32:58,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 12:32:58,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911945037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:32:58,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 12:32:58,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-01-10 12:32:58,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683766351] [2022-01-10 12:32:58,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:32:58,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 12:32:58,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:32:58,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 12:32:58,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:32:58,351 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 12:32:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:32:58,388 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-01-10 12:32:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 12:32:58,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-01-10 12:32:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:32:58,390 INFO L225 Difference]: With dead ends: 28 [2022-01-10 12:32:58,391 INFO L226 Difference]: Without dead ends: 24 [2022-01-10 12:32:58,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:32:58,406 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:32:58,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 93 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:32:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-10 12:32:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-01-10 12:32:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2022-01-10 12:32:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-01-10 12:32:58,417 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 22 [2022-01-10 12:32:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:32:58,417 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-01-10 12:32:58,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 12:32:58,418 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-01-10 12:32:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 12:32:58,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:32:58,421 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:32:58,440 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-10 12:32:58,636 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-10 12:32:58,637 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:32:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:32:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1731891524, now seen corresponding path program 1 times [2022-01-10 12:32:58,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:32:58,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674688821] [2022-01-10 12:32:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:32:58,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:32:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:32:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:32:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:32:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:32:58,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:32:58,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674688821] [2022-01-10 12:32:58,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674688821] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:32:58,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197869341] [2022-01-10 12:32:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:32:58,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:32:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:32:58,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:32:58,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 12:32:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:58,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 12:32:58,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:32:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 12:32:59,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:32:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:32:59,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197869341] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:32:59,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:32:59,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2022-01-10 12:32:59,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294363028] [2022-01-10 12:32:59,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:32:59,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 12:32:59,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:32:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 12:32:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-10 12:32:59,483 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 12 states, 10 states have (on average 2.8) internal successors, (28), 12 states have internal predecessors, (28), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 12:32:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:32:59,644 INFO L93 Difference]: Finished difference Result 46 states and 77 transitions. [2022-01-10 12:32:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 12:32:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 12 states have internal predecessors, (28), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 23 [2022-01-10 12:32:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:32:59,647 INFO L225 Difference]: With dead ends: 46 [2022-01-10 12:32:59,647 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 12:32:59,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-10 12:32:59,648 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:32:59,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:32:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 12:32:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 12:32:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (20), 8 states have call predecessors, (20), 5 states have call successors, (20) [2022-01-10 12:32:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 44 transitions. [2022-01-10 12:32:59,655 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 44 transitions. Word has length 23 [2022-01-10 12:32:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:32:59,655 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 44 transitions. [2022-01-10 12:32:59,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.8) internal successors, (28), 12 states have internal predecessors, (28), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-10 12:32:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2022-01-10 12:32:59,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 12:32:59,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:32:59,657 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:32:59,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 12:32:59,857 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,SelfDestructingSolverStorable3 [2022-01-10 12:32:59,858 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:32:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:32:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1995795547, now seen corresponding path program 2 times [2022-01-10 12:32:59,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:32:59,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744826893] [2022-01-10 12:32:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:32:59,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:32:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:32:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:32:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:32:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:00,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:33:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:00,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:33:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 12:33:00,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:33:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744826893] [2022-01-10 12:33:00,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744826893] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:33:00,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156560073] [2022-01-10 12:33:00,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 12:33:00,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:33:00,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:33:00,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:33:00,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 12:33:00,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 12:33:00,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:33:00,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 12:33:00,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:33:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-01-10 12:33:00,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:33:03,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190| Int) (|aux_div_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306| Int) (|aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329| Int) (|aux_div_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280| Int) (|aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329| Int)) (let ((.cse0 (* |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329| 4294967296))) (let ((.cse1 (+ |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329| 4294967296)) (.cse2 (+ 8589934592 |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329|)) (.cse5 (+ .cse0 (* 4294967296 |aux_div_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66|)))) (or (< .cse0 .cse1) (<= .cse2 .cse0) (let ((.cse4 (mod (+ (* 4294967295 |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329|) |c_fibo_fibo_#resInt| 4294967295) 4294967296))) (let ((.cse3 (* (- 1) .cse4))) (and (<= (div (+ .cse3 (- 4294967295)) (- 4294967296)) (+ (div (+ 4294967289 .cse4) 4294967296) 1)) (<= (div (+ (- 8589934586) .cse3) (- 4294967296)) (div (+ .cse3 (- 4294967296)) (- 4294967296)))))) (< .cse5 (+ 7 (* |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306| 4294967296) |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329|)) (< (+ (* |aux_div_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280| 4294967296) |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329|) (+ .cse0 4294967290)) (< |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329| |aux_div_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280|) (< .cse5 .cse1) (<= .cse2 .cse5) (<= 4294967296 |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329|) (< (+ |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306| 1) |aux_div_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190|) (< (+ (* 4294967296 |aux_div_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190|) |aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_5_61_66_190_280_306_329| 1) .cse5))))) is different from false [2022-01-10 12:33:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2022-01-10 12:33:04,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156560073] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:33:04,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:33:04,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 13] total 25 [2022-01-10 12:33:04,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983968381] [2022-01-10 12:33:04,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:33:04,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 12:33:04,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:33:04,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 12:33:04,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=485, Unknown=1, NotChecked=44, Total=600 [2022-01-10 12:33:04,862 INFO L87 Difference]: Start difference. First operand 28 states and 44 transitions. Second operand has 25 states, 20 states have (on average 2.0) internal successors, (40), 16 states have internal predecessors, (40), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 12 states have call predecessors, (13), 7 states have call successors, (13) [2022-01-10 12:33:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:33:05,568 INFO L93 Difference]: Finished difference Result 66 states and 143 transitions. [2022-01-10 12:33:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 12:33:05,568 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 2.0) internal successors, (40), 16 states have internal predecessors, (40), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 12 states have call predecessors, (13), 7 states have call successors, (13) Word has length 35 [2022-01-10 12:33:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:33:05,571 INFO L225 Difference]: With dead ends: 66 [2022-01-10 12:33:05,571 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 12:33:05,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=175, Invalid=1088, Unknown=1, NotChecked=68, Total=1332 [2022-01-10 12:33:05,572 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:33:05,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 127 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 275 Invalid, 0 Unknown, 32 Unchecked, 0.2s Time] [2022-01-10 12:33:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 12:33:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2022-01-10 12:33:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 8 states have return successors, (47), 12 states have call predecessors, (47), 7 states have call successors, (47) [2022-01-10 12:33:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2022-01-10 12:33:05,589 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 35 [2022-01-10 12:33:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:33:05,589 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2022-01-10 12:33:05,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 2.0) internal successors, (40), 16 states have internal predecessors, (40), 7 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 12 states have call predecessors, (13), 7 states have call successors, (13) [2022-01-10 12:33:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2022-01-10 12:33:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 12:33:05,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:33:05,596 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:33:05,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 12:33:05,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:33:05,796 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:33:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:33:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1775393395, now seen corresponding path program 3 times [2022-01-10 12:33:05,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:33:05,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427586058] [2022-01-10 12:33:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:33:05,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:33:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:05,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:33:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:05,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:05,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:33:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:05,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-10 12:33:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:05,958 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 12:33:05,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:33:05,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427586058] [2022-01-10 12:33:05,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427586058] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:33:05,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248282230] [2022-01-10 12:33:05,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 12:33:05,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:33:05,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:33:05,960 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:33:05,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 12:33:06,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 12:33:06,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:33:06,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 12:33:06,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:33:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 12:33:06,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:33:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-10 12:33:06,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248282230] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:33:06,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:33:06,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2022-01-10 12:33:06,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649065482] [2022-01-10 12:33:06,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:33:06,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 12:33:06,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:33:06,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 12:33:06,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-01-10 12:33:06,518 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand has 18 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 17 states have internal predecessors, (41), 8 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2022-01-10 12:33:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:33:07,233 INFO L93 Difference]: Finished difference Result 114 states and 289 transitions. [2022-01-10 12:33:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 12:33:07,234 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 17 states have internal predecessors, (41), 8 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 35 [2022-01-10 12:33:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:33:07,236 INFO L225 Difference]: With dead ends: 114 [2022-01-10 12:33:07,236 INFO L226 Difference]: Without dead ends: 79 [2022-01-10 12:33:07,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2022-01-10 12:33:07,238 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 59 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 12:33:07,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 102 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 12:33:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-10 12:33:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2022-01-10 12:33:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 11 states have call successors, (11), 4 states have call predecessors, (11), 13 states have return successors, (63), 18 states have call predecessors, (63), 11 states have call successors, (63) [2022-01-10 12:33:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 117 transitions. [2022-01-10 12:33:07,257 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 117 transitions. Word has length 35 [2022-01-10 12:33:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:33:07,257 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 117 transitions. [2022-01-10 12:33:07,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 17 states have internal predecessors, (41), 8 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2022-01-10 12:33:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 117 transitions. [2022-01-10 12:33:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 12:33:07,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:33:07,259 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:33:07,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 12:33:07,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:33:07,467 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:33:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:33:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2082323934, now seen corresponding path program 4 times [2022-01-10 12:33:07,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:33:07,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443848960] [2022-01-10 12:33:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:33:07,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:33:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:33:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:33:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 12:33:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:33:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:33:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-10 12:33:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 62 proven. 28 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-01-10 12:33:07,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:33:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443848960] [2022-01-10 12:33:07,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443848960] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:33:07,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312264926] [2022-01-10 12:33:07,731 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 12:33:07,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:33:07,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:33:07,738 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:33:07,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 12:33:07,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 12:33:07,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:33:07,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-10 12:33:07,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:33:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-01-10 12:33:08,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:33:10,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| Int) (|aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| Int)) (let ((.cse0 (+ (* |aux_div_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| 4294967296) |aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102|)) (.cse1 (* |aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| 4294967295))) (or (<= (+ |c_fibo_fibo_#resInt| 8589934591) .cse0) (= (mod (+ .cse1 6) 4294967296) 5) (< .cse0 (+ |c_fibo_fibo_#resInt| 4294967295)) (> 0 |aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102|) (not (= (mod (+ .cse1 |c_fibo_fibo_#resInt| 5) 4294967296) 5)) (>= |aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| 4294967296)))) is different from false [2022-01-10 12:33:12,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| Int) (|aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| Int)) (let ((.cse1 (mod (+ |c_fibo_fibo_#t~ret5Int| |c_fibo_fibo_#t~ret4Int|) 4294967296)) (.cse0 (+ (* |aux_div_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| 4294967296) |aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102|)) (.cse2 (* |aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| 4294967295))) (or (< .cse0 (+ .cse1 4294967295)) (not (= (mod (+ .cse1 .cse2 5) 4294967296) 5)) (<= (+ .cse1 8589934591) .cse0) (= (mod (+ .cse2 6) 4294967296) 5) (> 0 |aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102|) (>= |aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102| 4294967296)))) is different from false [2022-01-10 12:33:15,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_13_80_108_114_175| Int) (|aux_div_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_13_80_108_114| Int) (|aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102_79| Int) (|aux_div_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102_79| Int) (|aux_div_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_13_80_108| Int)) (let ((.cse7 (* |aux_div_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_13_80_108_114| 4294967296)) (.cse6 (* |aux_div_aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_13_80_108_114_175| 4294967296))) (let ((.cse0 (+ |aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102_79| (* |aux_div_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102_79| 4294967296))) (.cse3 (* |c_fibo_fibo_#resInt| 4294967296)) (.cse2 (+ .cse7 .cse6 (* |aux_div_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_13_80_108| 4294967296))) (.cse5 (+ .cse7 .cse6)) (.cse4 (* 18446744069414584320 |aux_div_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102_79|)) (.cse1 (* |aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102_79| 4294967295))) (or (<= 4294967296 .cse0) (not (= 5 (mod (+ |c_fibo_fibo_#resInt| 5 .cse1) 4294967296))) (< .cse0 0) (< .cse2 (+ .cse3 .cse4 .cse1 4294967296)) (<= (+ .cse3 .cse4 8589934592 .cse1) .cse2) (<= (+ .cse4 |c_fibo_fibo_#resInt| .cse1 8589934591) .cse5) (< .cse5 (+ .cse4 |c_fibo_fibo_#resInt| .cse1 4294967295)) (< .cse6 (+ .cse4 .cse1)) (<= (+ .cse4 .cse1 4294967296) .cse6) (= (mod (+ .cse1 6) 4294967296) 5) (<= 4294967296 |aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102_79|) (< |aux_mod_aux_mod_aux_mod_v_fibo_fibo_#t~ret4Int_BEFORE_CALL_12_62_102_79| 0))))) is different from false [2022-01-10 12:33:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 28 proven. 37 refuted. 4 times theorem prover too weak. 154 trivial. 42 not checked. [2022-01-10 12:33:26,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312264926] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:33:26,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:33:26,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 17] total 30 [2022-01-10 12:33:26,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140594347] [2022-01-10 12:33:26,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:33:26,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 12:33:26,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:33:26,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 12:33:26,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=617, Unknown=6, NotChecked=156, Total=870 [2022-01-10 12:33:26,518 INFO L87 Difference]: Start difference. First operand 63 states and 117 transitions. Second operand has 30 states, 25 states have (on average 1.84) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 12 states have return successors, (18), 13 states have call predecessors, (18), 7 states have call successors, (18) [2022-01-10 12:33:27,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:33:27,016 INFO L93 Difference]: Finished difference Result 115 states and 210 transitions. [2022-01-10 12:33:27,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 12:33:27,017 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 1.84) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 12 states have return successors, (18), 13 states have call predecessors, (18), 7 states have call successors, (18) Word has length 71 [2022-01-10 12:33:27,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:33:27,017 INFO L225 Difference]: With dead ends: 115 [2022-01-10 12:33:27,017 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 12:33:27,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=185, Invalid=1153, Unknown=6, NotChecked=216, Total=1560 [2022-01-10 12:33:27,019 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:33:27,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 169 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 274 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2022-01-10 12:33:27,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 12:33:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2022-01-10 12:33:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 4 states have call predecessors, (7), 8 states have return successors, (22), 10 states have call predecessors, (22), 7 states have call successors, (22) [2022-01-10 12:33:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-01-10 12:33:27,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 62 transitions. Word has length 71 [2022-01-10 12:33:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:33:27,033 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-01-10 12:33:27,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 1.84) internal successors, (46), 19 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 12 states have return successors, (18), 13 states have call predecessors, (18), 7 states have call successors, (18) [2022-01-10 12:33:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-01-10 12:33:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-01-10 12:33:27,036 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:33:27,036 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:33:27,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-10 12:33:27,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:33:27,256 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:33:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:33:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1737339745, now seen corresponding path program 5 times [2022-01-10 12:33:27,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:33:27,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926425155] [2022-01-10 12:33:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:33:27,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:33:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 12:33:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 12:33:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-10 12:33:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-10 12:33:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 12:33:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-10 12:33:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 12:33:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-10 12:33:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-10 12:33:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 12:33:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 12:33:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-10 12:33:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:33:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 257 proven. 368 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-01-10 12:33:28,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:33:28,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926425155] [2022-01-10 12:33:28,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926425155] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:33:28,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217565168] [2022-01-10 12:33:28,343 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 12:33:28,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:33:28,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:33:28,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:33:28,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 12:33:28,854 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-01-10 12:33:28,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:33:28,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-10 12:33:28,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:33:42,663 WARN L228 SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 5011 DAG size of output: 1950 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-10 12:33:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 293 proven. 252 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2022-01-10 12:33:47,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:33:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 307 proven. 276 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2022-01-10 12:33:49,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217565168] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:33:49,039 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:33:49,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 16] total 41 [2022-01-10 12:33:49,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562829976] [2022-01-10 12:33:49,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:33:49,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-10 12:33:49,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:33:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-10 12:33:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1413, Unknown=0, NotChecked=0, Total=1640 [2022-01-10 12:33:49,041 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. Second operand has 41 states, 30 states have (on average 2.533333333333333) internal successors, (76), 35 states have internal predecessors, (76), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (38), 23 states have call predecessors, (38), 25 states have call successors, (38) [2022-01-10 12:33:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:33:50,278 INFO L93 Difference]: Finished difference Result 100 states and 167 transitions. [2022-01-10 12:33:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 12:33:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 30 states have (on average 2.533333333333333) internal successors, (76), 35 states have internal predecessors, (76), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (38), 23 states have call predecessors, (38), 25 states have call successors, (38) Word has length 137 [2022-01-10 12:33:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:33:50,280 INFO L225 Difference]: With dead ends: 100 [2022-01-10 12:33:50,280 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 12:33:50,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 279 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=459, Invalid=2193, Unknown=0, NotChecked=0, Total=2652 [2022-01-10 12:33:50,281 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 176 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 12:33:50,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 172 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 12:33:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 12:33:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2022-01-10 12:33:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.0) internal successors, (32), 32 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-10 12:33:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-01-10 12:33:50,288 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 137 [2022-01-10 12:33:50,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:33:50,288 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-01-10 12:33:50,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 30 states have (on average 2.533333333333333) internal successors, (76), 35 states have internal predecessors, (76), 25 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (38), 23 states have call predecessors, (38), 25 states have call successors, (38) [2022-01-10 12:33:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-01-10 12:33:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 12:33:50,289 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:33:50,289 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:33:50,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 12:33:50,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:33:50,495 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:33:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:33:50,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1515641660, now seen corresponding path program 6 times [2022-01-10 12:33:50,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:33:50,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076881644] [2022-01-10 12:33:50,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:33:50,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:33:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 12:33:50,522 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 12:33:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 12:33:50,558 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 12:33:50,559 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 12:33:50,567 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 12:33:50,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 12:33:50,572 INFO L732 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-01-10 12:33:50,575 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 12:33:50,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:33:50 BasicIcfg [2022-01-10 12:33:50,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 12:33:50,635 INFO L158 Benchmark]: Toolchain (without parser) took 53756.44ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 144.8MB in the beginning and 309.3MB in the end (delta: -164.5MB). Peak memory consumption was 180.7MB. Max. memory is 8.0GB. [2022-01-10 12:33:50,636 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory was 160.8MB in the beginning and 160.6MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 12:33:50,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.10ms. Allocated memory is still 195.0MB. Free memory was 144.5MB in the beginning and 172.5MB in the end (delta: -28.0MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-01-10 12:33:50,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.01ms. Allocated memory is still 195.0MB. Free memory was 172.5MB in the beginning and 170.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 12:33:50,636 INFO L158 Benchmark]: Boogie Preprocessor took 13.06ms. Allocated memory is still 195.0MB. Free memory was 170.9MB in the beginning and 169.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 12:33:50,636 INFO L158 Benchmark]: RCFGBuilder took 172.60ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 160.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-10 12:33:50,636 INFO L158 Benchmark]: IcfgTransformer took 70.97ms. Allocated memory is still 195.0MB. Free memory was 160.4MB in the beginning and 157.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 12:33:50,637 INFO L158 Benchmark]: TraceAbstraction took 53295.69ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 157.3MB in the beginning and 309.3MB in the end (delta: -152.0MB). Peak memory consumption was 193.1MB. Max. memory is 8.0GB. [2022-01-10 12:33:50,638 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.11ms. Allocated memory is still 195.0MB. Free memory was 160.8MB in the beginning and 160.6MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.10ms. Allocated memory is still 195.0MB. Free memory was 144.5MB in the beginning and 172.5MB in the end (delta: -28.0MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.01ms. Allocated memory is still 195.0MB. Free memory was 172.5MB in the beginning and 170.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.06ms. Allocated memory is still 195.0MB. Free memory was 170.9MB in the beginning and 169.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 172.60ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 160.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 70.97ms. Allocated memory is still 195.0MB. Free memory was 160.4MB in the beginning and 157.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 53295.69ms. Allocated memory was 195.0MB in the beginning and 338.7MB in the end (delta: 143.7MB). Free memory was 157.3MB in the beginning and 309.3MB in the end (delta: -152.0MB). Peak memory consumption was 193.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 5; VAL [x=5] [L27] CALL, EXPR fibo(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=-1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=-1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=-1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=-1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=-1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=-1, fibo(n-2)=-1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=-2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=-1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=-1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=-1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=-2, fibo(n-2)=-1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=-1, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=-1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=-1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=-1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=-1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=-1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=-1, fibo(n-2)=-1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=-1, fibo(n-2)=-2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=-3, x=5] [L27] int result = fibo(x); [L28] COND TRUE result == 5 VAL [result=5, x=5] [L29] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.2s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 830 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 118 IncrementalHoareTripleChecker+Unchecked, 700 mSDsCounter, 334 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1343 IncrementalHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 334 mSolverCounterUnsat, 130 mSDtfsCounter, 1343 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 619 SyntacticMatches, 29 SemanticMatches, 181 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=6, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 47.0s InterpolantComputationTime, 766 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 949 ConstructedInterpolants, 9 QuantifiedInterpolants, 6529 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1542 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 3291/4467 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-10 12:33:50,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...