./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/fibo_2calls_5-1.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c ../results/automizer-verification-files/SV-COMP24_unreach-call/fibo_2calls_5-1.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:45:40,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:45:40,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:45:40,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:45:40,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:45:40,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:45:40,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:45:40,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:45:40,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:45:40,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:45:40,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:45:40,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:45:40,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:45:40,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:45:40,554 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:45:40,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:45:40,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:45:40,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:45:40,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:45:40,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:45:40,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:45:40,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:45:40,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:45:40,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:45:40,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:45:40,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:45:40,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:45:40,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:45:40,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:45:40,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:45:40,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:45:40,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:45:40,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:45:40,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:45:40,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:45:40,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:45:40,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:45:40,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:45:40,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:45:40,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:45:40,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:45:40,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:45:40,561 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-20 13:45:40,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:45:40,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:45:40,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:45:40,751 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-20 13:45:40,753 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-20 13:45:40,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/fibo_2calls_5-1.yml/witness-2.1.yml [2024-09-20 13:45:40,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:45:40,819 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:45:40,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-09-20 13:45:41,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:45:42,147 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:45:42,148 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-09-20 13:45:42,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/dd207b7d7/dffb6559f2844ca8b364cf8554b6f56e/FLAGb7041e66f [2024-09-20 13:45:42,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/dd207b7d7/dffb6559f2844ca8b364cf8554b6f56e [2024-09-20 13:45:42,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:45:42,573 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-20 13:45:42,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:45:42,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:45:42,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:45:42,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:45:40" (1/2) ... [2024-09-20 13:45:42,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf2f709 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:45:42, skipping insertion in model container [2024-09-20 13:45:42,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:45:40" (1/2) ... [2024-09-20 13:45:42,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6708d93d and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:45:42, skipping insertion in model container [2024-09-20 13:45:42,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:45:42" (2/2) ... [2024-09-20 13:45:42,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf2f709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42, skipping insertion in model container [2024-09-20 13:45:42,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:45:42" (2/2) ... [2024-09-20 13:45:42,586 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-20 13:45:42,586 INFO L1541 ArrayList]: Function contract at [L9]: requires null, ensures ((((\result == 0) || (1 < \old(n))) || (\old(n) == 1)) && ((\old(n) != 1) || (\result == 1))) [2024-09-20 13:45:42,586 INFO L1541 ArrayList]: Function contract at [L19]: requires null, ensures (((((\result == 1) && (\old(n) == 1)) || (\result == 0)) || (2 < \old(n))) && ((((((2 == \result) && (3 == \old(n))) || ((\result == 1) && (\old(n) == 1))) || ((3 == \result) && (\old(n) == 4))) || (4 < \old(n))) || (\old(n) < 1))) [2024-09-20 13:45:42,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:45:42,752 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c[946,959] [2024-09-20 13:45:42,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:45:42,771 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-20 13:45:42,806 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c[946,959] [2024-09-20 13:45:42,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:45:42,827 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:45:42,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42 WrapperNode [2024-09-20 13:45:42,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:45:42,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:45:42,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:45:42,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:45:42,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,852 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-09-20 13:45:42,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:45:42,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:45:42,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:45:42,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:45:42,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,874 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure fibo2 is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-20 13:45:42,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:45:42,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:45:42,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:45:42,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:45:42,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (1/1) ... [2024-09-20 13:45:42,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:45:42,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:45:42,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 13:45:42,903 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 13:45:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:45:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-20 13:45:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-20 13:45:42,936 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-20 13:45:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-20 13:45:42,936 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-20 13:45:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:45:42,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:45:42,980 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:45:42,981 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:45:43,083 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-09-20 13:45:43,084 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:45:43,100 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:45:43,100 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 13:45:43,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:45:43 BoogieIcfgContainer [2024-09-20 13:45:43,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:45:43,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:45:43,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:45:43,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:45:43,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:45:40" (1/4) ... [2024-09-20 13:45:43,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff2b6b and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:45:43, skipping insertion in model container [2024-09-20 13:45:43,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:45:42" (2/4) ... [2024-09-20 13:45:43,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff2b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:45:43, skipping insertion in model container [2024-09-20 13:45:43,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:45:42" (3/4) ... [2024-09-20 13:45:43,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff2b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:45:43, skipping insertion in model container [2024-09-20 13:45:43,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:45:43" (4/4) ... [2024-09-20 13:45:43,111 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2024-09-20 13:45:43,123 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:45:43,123 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-20 13:45:43,155 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:45:43,160 INFO L336 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@197f5eef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:45:43,160 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-20 13:45:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 13:45:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-20 13:45:43,167 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:43,167 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-20 13:45:43,168 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting fibo1Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:43,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash 83656213, now seen corresponding path program 1 times [2024-09-20 13:45:43,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:43,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121686088] [2024-09-20 13:45:43,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:43,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:43,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121686088] [2024-09-20 13:45:43,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121686088] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:43,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:45:43,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307384807] [2024-09-20 13:45:43,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:43,341 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:45:43,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:43,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:45:43,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:43,361 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:43,408 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-09-20 13:45:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:45:43,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-20 13:45:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:43,417 INFO L225 Difference]: With dead ends: 39 [2024-09-20 13:45:43,417 INFO L226 Difference]: Without dead ends: 37 [2024-09-20 13:45:43,418 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:43,421 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:43,422 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-20 13:45:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-09-20 13:45:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 24 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 13:45:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-09-20 13:45:43,451 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 5 [2024-09-20 13:45:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:43,451 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-09-20 13:45:43,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:43,451 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-09-20 13:45:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-20 13:45:43,452 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:43,452 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:43,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:45:43,452 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting fibo2Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:43,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash 422480245, now seen corresponding path program 1 times [2024-09-20 13:45:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:43,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767896087] [2024-09-20 13:45:43,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:43,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:43,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767896087] [2024-09-20 13:45:43,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767896087] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:43,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:45:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120783269] [2024-09-20 13:45:43,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:43,524 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:45:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:43,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:45:43,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:45:43,525 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:43,595 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2024-09-20 13:45:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:45:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-09-20 13:45:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:43,597 INFO L225 Difference]: With dead ends: 40 [2024-09-20 13:45:43,597 INFO L226 Difference]: Without dead ends: 40 [2024-09-20 13:45:43,597 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:45:43,598 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:43,598 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:45:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-20 13:45:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-09-20 13:45:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 13:45:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-20 13:45:43,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 9 [2024-09-20 13:45:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:43,607 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-20 13:45:43,609 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-20 13:45:43,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-20 13:45:43,610 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:43,610 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:43,610 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 13:45:43,610 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:43,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash 398305833, now seen corresponding path program 1 times [2024-09-20 13:45:43,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:43,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450456710] [2024-09-20 13:45:43,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:43,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:45:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:43,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:43,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450456710] [2024-09-20 13:45:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450456710] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:43,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:43,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:45:43,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70802064] [2024-09-20 13:45:43,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:43,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:45:43,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:43,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:45:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:43,686 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2024-09-20 13:45:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:43,748 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-09-20 13:45:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:45:43,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-09-20 13:45:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:43,750 INFO L225 Difference]: With dead ends: 46 [2024-09-20 13:45:43,750 INFO L226 Difference]: Without dead ends: 44 [2024-09-20 13:45:43,750 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:43,751 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:43,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 74 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:45:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-20 13:45:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-09-20 13:45:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 13:45:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-09-20 13:45:43,756 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 9 [2024-09-20 13:45:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:43,756 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-09-20 13:45:43,757 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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) [2024-09-20 13:45:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-09-20 13:45:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-20 13:45:43,757 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:43,757 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:43,757 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 13:45:43,757 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting fibo2Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:43,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:43,758 INFO L85 PathProgramCache]: Analyzing trace with hash 211986483, now seen corresponding path program 1 times [2024-09-20 13:45:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361037719] [2024-09-20 13:45:43,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:43,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:43,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361037719] [2024-09-20 13:45:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361037719] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 13:45:43,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745815962] [2024-09-20 13:45:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:43,844 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 13:45:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:43,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 13:45:43,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:45:43,844 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:43,932 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-09-20 13:45:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 13:45:43,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-20 13:45:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:43,933 INFO L225 Difference]: With dead ends: 46 [2024-09-20 13:45:43,933 INFO L226 Difference]: Without dead ends: 46 [2024-09-20 13:45:43,933 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-20 13:45:43,934 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:43,934 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 149 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:45:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-20 13:45:43,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-09-20 13:45:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 13:45:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-09-20 13:45:43,942 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 10 [2024-09-20 13:45:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:43,942 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-09-20 13:45:43,942 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-09-20 13:45:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-20 13:45:43,943 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:43,943 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:43,943 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 13:45:43,946 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting fibo1Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:43,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1688882568, now seen corresponding path program 1 times [2024-09-20 13:45:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429883823] [2024-09-20 13:45:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 13:45:43,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:43,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429883823] [2024-09-20 13:45:43,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429883823] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:43,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:43,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:45:43,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107095316] [2024-09-20 13:45:43,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:43,997 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:45:43,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:43,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:45:43,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:45:43,998 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:44,040 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-09-20 13:45:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:45:44,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-20 13:45:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:44,042 INFO L225 Difference]: With dead ends: 50 [2024-09-20 13:45:44,042 INFO L226 Difference]: Without dead ends: 50 [2024-09-20 13:45:44,043 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:45:44,045 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:44,045 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-20 13:45:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-09-20 13:45:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-20 13:45:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-09-20 13:45:44,053 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 13 [2024-09-20 13:45:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:44,053 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-09-20 13:45:44,053 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-09-20 13:45:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 13:45:44,054 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:44,054 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:44,054 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 13:45:44,054 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting fibo1Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:44,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash 815752847, now seen corresponding path program 1 times [2024-09-20 13:45:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502317595] [2024-09-20 13:45:44,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:44,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:44,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502317595] [2024-09-20 13:45:44,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502317595] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:44,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:44,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:45:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787227560] [2024-09-20 13:45:44,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:44,134 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:45:44,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:44,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:45:44,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:45:44,137 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:44,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:44,194 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2024-09-20 13:45:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 13:45:44,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-09-20 13:45:44,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:44,195 INFO L225 Difference]: With dead ends: 62 [2024-09-20 13:45:44,195 INFO L226 Difference]: Without dead ends: 62 [2024-09-20 13:45:44,195 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:45:44,195 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:44,196 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:45:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-20 13:45:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2024-09-20 13:45:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-20 13:45:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2024-09-20 13:45:44,209 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 14 [2024-09-20 13:45:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:44,209 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-09-20 13:45:44,209 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2024-09-20 13:45:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-20 13:45:44,210 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:44,210 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:44,210 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 13:45:44,210 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting fibo2Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:44,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1887144096, now seen corresponding path program 1 times [2024-09-20 13:45:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512331561] [2024-09-20 13:45:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:44,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:44,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:44,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512331561] [2024-09-20 13:45:44,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512331561] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:45:44,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007594174] [2024-09-20 13:45:44,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:44,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:45:44,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:45:44,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:45:44,338 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 13:45:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:44,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 13:45:44,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:45:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:44,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:45:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007594174] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:45:44,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:45:44,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-09-20 13:45:44,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311383616] [2024-09-20 13:45:44,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:45:44,537 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 13:45:44,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:44,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 13:45:44,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-09-20 13:45:44,538 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:44,668 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2024-09-20 13:45:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-20 13:45:44,668 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-09-20 13:45:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:44,669 INFO L225 Difference]: With dead ends: 76 [2024-09-20 13:45:44,669 INFO L226 Difference]: Without dead ends: 76 [2024-09-20 13:45:44,669 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-09-20 13:45:44,670 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:44,670 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 237 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:45:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-20 13:45:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-09-20 13:45:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-20 13:45:44,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2024-09-20 13:45:44,680 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 18 [2024-09-20 13:45:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:44,680 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2024-09-20 13:45:44,681 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2024-09-20 13:45:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-20 13:45:44,681 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:44,681 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-09-20 13:45:44,695 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-20 13:45:44,882 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 13:45:44,882 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting fibo2Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:44,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2123869197, now seen corresponding path program 2 times [2024-09-20 13:45:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:44,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374691884] [2024-09-20 13:45:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:44,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:45,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374691884] [2024-09-20 13:45:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374691884] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:45,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:45,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-09-20 13:45:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983289627] [2024-09-20 13:45:45,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:45,018 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-20 13:45:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:45,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-20 13:45:45,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-09-20 13:45:45,018 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:45,222 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2024-09-20 13:45:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-20 13:45:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-09-20 13:45:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:45,223 INFO L225 Difference]: With dead ends: 102 [2024-09-20 13:45:45,223 INFO L226 Difference]: Without dead ends: 102 [2024-09-20 13:45:45,224 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-09-20 13:45:45,224 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 67 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:45,224 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 119 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:45:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-20 13:45:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2024-09-20 13:45:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.234375) internal successors, (79), 66 states have internal predecessors, (79), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-20 13:45:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2024-09-20 13:45:45,235 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 26 [2024-09-20 13:45:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:45,235 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2024-09-20 13:45:45,235 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:45:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2024-09-20 13:45:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-20 13:45:45,236 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:45,236 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:45,236 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-20 13:45:45,236 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting fibo1Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:45,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash 512134780, now seen corresponding path program 1 times [2024-09-20 13:45:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:45,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117455399] [2024-09-20 13:45:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:45,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:45:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-20 13:45:45,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:45,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117455399] [2024-09-20 13:45:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117455399] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:45:45,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:45:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 13:45:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998572519] [2024-09-20 13:45:45,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:45:45,284 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:45:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:45,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:45:45,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:45,287 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:45:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:45,313 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2024-09-20 13:45:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:45:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-09-20 13:45:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:45,315 INFO L225 Difference]: With dead ends: 103 [2024-09-20 13:45:45,315 INFO L226 Difference]: Without dead ends: 103 [2024-09-20 13:45:45,315 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:45:45,315 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:45,315 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:45:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-09-20 13:45:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-09-20 13:45:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-20 13:45:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-20 13:45:45,327 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 28 [2024-09-20 13:45:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:45,327 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-20 13:45:45,327 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:45:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-20 13:45:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-20 13:45:45,328 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:45,328 INFO L216 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:45,328 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-20 13:45:45,328 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting fibo2Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:45,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1760453507, now seen corresponding path program 1 times [2024-09-20 13:45:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057064688] [2024-09-20 13:45:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:45,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:45:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:45,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 13:45:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-20 13:45:45,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:45:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057064688] [2024-09-20 13:45:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057064688] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:45:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142460681] [2024-09-20 13:45:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:45,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:45:45,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:45:45,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:45:45,399 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 13:45:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:45:45,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-20 13:45:45,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:45:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:45:45,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:45:45,685 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 13:45:45,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142460681] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:45:45,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:45:45,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 16 [2024-09-20 13:45:45,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183999765] [2024-09-20 13:45:45,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:45:45,688 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-20 13:45:45,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:45:45,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-20 13:45:45,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-09-20 13:45:45,689 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 13:45:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:45:45,870 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2024-09-20 13:45:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-20 13:45:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-09-20 13:45:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:45:45,871 INFO L225 Difference]: With dead ends: 108 [2024-09-20 13:45:45,871 INFO L226 Difference]: Without dead ends: 104 [2024-09-20 13:45:45,871 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-09-20 13:45:45,872 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:45:45,872 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 194 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:45:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-20 13:45:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2024-09-20 13:45:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 17 states have call successors, (17), 10 states have call predecessors, (17), 11 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2024-09-20 13:45:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2024-09-20 13:45:45,877 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 30 [2024-09-20 13:45:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:45:45,877 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2024-09-20 13:45:45,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 13:45:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2024-09-20 13:45:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-20 13:45:45,878 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:45:45,878 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:45,891 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 13:45:46,078 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-20 13:45:46,079 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting fibo2Err0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, fibo2Err0ENSURES_VIOLATIONPOST_CONDITION, fibo1Err0ENSURES_VIOLATIONPOST_CONDITION] === [2024-09-20 13:45:46,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:45:46,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1938157796, now seen corresponding path program 1 times [2024-09-20 13:45:46,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:45:46,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995478146] [2024-09-20 13:45:46,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:45:46,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:45:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 13:45:46,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-20 13:45:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 13:45:46,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-20 13:45:46,110 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-20 13:45:46,110 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location fibo2Err0ENSURES_VIOLATIONPOST_CONDITION (2 of 3 remaining) [2024-09-20 13:45:46,111 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-09-20 13:45:46,112 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location fibo1Err0ENSURES_VIOLATIONPOST_CONDITION (0 of 3 remaining) [2024-09-20 13:45:46,112 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-20 13:45:46,114 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:45:46,133 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:45:46,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:45:46 BoogieIcfgContainer [2024-09-20 13:45:46,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 13:45:46,135 INFO L158 Benchmark]: Toolchain (without parser) took 3562.30ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 80.7MB in the beginning and 106.6MB in the end (delta: -25.8MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-09-20 13:45:46,136 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:45:46,136 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 151.0MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:45:46,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.85ms. Allocated memory is still 151.0MB. Free memory was 80.6MB in the beginning and 114.7MB in the end (delta: -34.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-20 13:45:46,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.75ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 113.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:45:46,136 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 151.0MB. Free memory was 113.7MB in the beginning and 112.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:45:46,137 INFO L158 Benchmark]: RCFGBuilder took 219.38ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 98.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 13:45:46,137 INFO L158 Benchmark]: TraceAbstraction took 3033.60ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 97.9MB in the beginning and 106.6MB in the end (delta: -8.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-09-20 13:45:46,138 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.65ms. Allocated memory is still 151.0MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.85ms. Allocated memory is still 151.0MB. Free memory was 80.6MB in the beginning and 114.7MB in the end (delta: -34.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.75ms. Allocated memory is still 151.0MB. Free memory was 114.7MB in the beginning and 113.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 151.0MB. Free memory was 113.7MB in the beginning and 112.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 219.38ms. Allocated memory is still 151.0MB. Free memory was 111.6MB in the beginning and 98.4MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3033.60ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 97.9MB in the beginning and 106.6MB in the end (delta: -8.7MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: procedure postcondition can be violated procedure postcondition can be violated We found a FailurePath: [L38] int x = 5; VAL [x=5] [L39] CALL fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); - UnprovableResult [Line: 41]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 9]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 296 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 1190 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 927 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1050 IncrementalHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 263 mSDtfsCounter, 1050 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 85 SyntacticMatches, 19 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=10, InterpolantAutomatonStates: 77, 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, 10 MinimizatonAttempts, 54 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 241 NumberOfCodeBlocks, 241 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 558 SizeOfPredicates, 8 NumberOfNonLiveVariables, 147 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 74/129 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! [2024-09-20 13:45:46,156 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE