./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6597d5a31aa324ba443314d2c363b302cd71d697c12811ade53ae3225a095206 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:26:13,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:26:13,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:26:13,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:26:13,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:26:13,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:26:13,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:26:13,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:26:13,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:26:13,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:26:13,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:26:13,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:26:13,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:26:13,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:26:13,650 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:26:13,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:26:13,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:26:13,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:26:13,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:26:13,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:26:13,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:26:13,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:26:13,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:26:13,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:26:13,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:26:13,656 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:26:13,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:26:13,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:26:13,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:26:13,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:26:13,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:26:13,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:26:13,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:26:13,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:26:13,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:26:13,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:26:13,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:26:13,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:26:13,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:26:13,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:26:13,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:26:13,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:26:13,662 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.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6597d5a31aa324ba443314d2c363b302cd71d697c12811ade53ae3225a095206 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:26:13,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:26:14,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:26:14,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:26:14,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:26:14,012 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:26:14,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2024-09-25 11:26:15,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:26:15,747 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:26:15,748 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_2-2.c [2024-09-25 11:26:15,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/be3b826ae/dad9c40a71744217830a438a05b27d21/FLAG13daefc50 [2024-09-25 11:26:15,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/be3b826ae/dad9c40a71744217830a438a05b27d21 [2024-09-25 11:26:15,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:26:15,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:26:15,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:26:15,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:26:15,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:26:15,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:26:15" (1/1) ... [2024-09-25 11:26:15,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d5b3220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:15, skipping insertion in model container [2024-09-25 11:26:15,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:26:15" (1/1) ... [2024-09-25 11:26:15,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:26:15,949 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_2-2.c[946,959] [2024-09-25 11:26:15,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:26:15,972 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:26:15,990 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_2-2.c[946,959] [2024-09-25 11:26:15,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:26:16,008 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:26:16,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16 WrapperNode [2024-09-25 11:26:16,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:26:16,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:26:16,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:26:16,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:26:16,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,030 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:26:16,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:26:16,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:26:16,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:26:16,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:26:16,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,051 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 11:26:16,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:26:16,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:26:16,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:26:16,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:26:16,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (1/1) ... [2024-09-25 11:26:16,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:26:16,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:16,095 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-25 11:26:16,101 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-25 11:26:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:26:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:26:16,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:26:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:26:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-25 11:26:16,142 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-25 11:26:16,142 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-25 11:26:16,143 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-25 11:26:16,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:26:16,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:26:16,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:26:16,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:26:16,196 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:26:16,197 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:26:16,352 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-25 11:26:16,352 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:26:16,378 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:26:16,379 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:26:16,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:26:16 BoogieIcfgContainer [2024-09-25 11:26:16,379 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:26:16,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:26:16,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:26:16,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:26:16,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:26:15" (1/3) ... [2024-09-25 11:26:16,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:26:16, skipping insertion in model container [2024-09-25 11:26:16,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:16" (2/3) ... [2024-09-25 11:26:16,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8a39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:26:16, skipping insertion in model container [2024-09-25 11:26:16,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:26:16" (3/3) ... [2024-09-25 11:26:16,390 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_2-2.c [2024-09-25 11:26:16,406 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:26:16,406 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:26:16,465 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:26:16,471 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=All, 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;@1233c7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:26:16,471 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:26:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 11:26:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 11:26:16,490 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:16,490 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:16,491 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:16,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash -685851838, now seen corresponding path program 1 times [2024-09-25 11:26:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839603162] [2024-09-25 11:26:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:16,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:16,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:16,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:16,774 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-25 11:26:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:16,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839603162] [2024-09-25 11:26:16,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839603162] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:26:16,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:26:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:26:16,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783064780] [2024-09-25 11:26:16,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:26:16,782 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:26:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:16,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:26:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:26:16,802 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:26:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:16,898 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-25 11:26:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:26:16,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-25 11:26:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:16,909 INFO L225 Difference]: With dead ends: 44 [2024-09-25 11:26:16,909 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:26:16,912 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-25 11:26:16,917 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:16,917 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 103 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:26:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:26:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 11:26:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-25 11:26:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-25 11:26:16,958 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2024-09-25 11:26:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:16,959 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-25 11:26:16,959 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:26:16,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-25 11:26:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 11:26:16,961 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:16,961 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:16,961 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:26:16,962 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:16,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:16,964 INFO L85 PathProgramCache]: Analyzing trace with hash 924954813, now seen corresponding path program 1 times [2024-09-25 11:26:16,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:16,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172079546] [2024-09-25 11:26:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:16,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,087 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-25 11:26:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:17,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172079546] [2024-09-25 11:26:17,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172079546] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:26:17,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:26:17,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:26:17,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725068607] [2024-09-25 11:26:17,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:26:17,090 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:26:17,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:17,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:26:17,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:26:17,092 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:26:17,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:17,156 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-09-25 11:26:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:26:17,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-09-25 11:26:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:17,157 INFO L225 Difference]: With dead ends: 36 [2024-09-25 11:26:17,157 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:26:17,158 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-25 11:26:17,159 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:17,163 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:26:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:26:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 11:26:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-25 11:26:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-25 11:26:17,179 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2024-09-25 11:26:17,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:17,180 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-25 11:26:17,180 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:26:17,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-25 11:26:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 11:26:17,181 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:17,181 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:17,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:26:17,182 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:17,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1782416332, now seen corresponding path program 1 times [2024-09-25 11:26:17,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:17,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238843286] [2024-09-25 11:26:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 11:26:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:26:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238843286] [2024-09-25 11:26:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238843286] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616181018] [2024-09-25 11:26:17,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:17,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:17,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:17,404 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-25 11:26:17,409 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-25 11:26:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:17,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 11:26:17,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:26:17,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:26:17,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616181018] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:17,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:17,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-25 11:26:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352640437] [2024-09-25 11:26:17,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:17,832 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 11:26:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:17,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 11:26:17,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-25 11:26:17,833 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:26:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:18,011 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-09-25 11:26:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:26:18,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 26 [2024-09-25 11:26:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:18,013 INFO L225 Difference]: With dead ends: 58 [2024-09-25 11:26:18,013 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 11:26:18,014 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:26:18,015 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:18,015 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 163 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:26:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 11:26:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-09-25 11:26:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-25 11:26:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-25 11:26:18,030 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2024-09-25 11:26:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:18,030 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-25 11:26:18,030 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:26:18,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-25 11:26:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:26:18,035 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:18,035 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:18,051 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:26:18,238 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:18,238 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:18,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash -836643613, now seen corresponding path program 1 times [2024-09-25 11:26:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:18,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911801670] [2024-09-25 11:26:18,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:18,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:18,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:18,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:18,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:18,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:26:18,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:18,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911801670] [2024-09-25 11:26:18,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911801670] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:18,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211481351] [2024-09-25 11:26:18,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:18,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:18,461 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-25 11:26:18,462 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-25 11:26:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:18,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-25 11:26:18,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:26:18,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:26:18,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211481351] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:18,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:18,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2024-09-25 11:26:18,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183590246] [2024-09-25 11:26:18,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:18,655 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 11:26:18,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:18,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 11:26:18,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-09-25 11:26:18,656 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:26:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:18,717 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-09-25 11:26:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:26:18,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2024-09-25 11:26:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:18,723 INFO L225 Difference]: With dead ends: 46 [2024-09-25 11:26:18,725 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 11:26:18,725 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-09-25 11:26:18,726 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:18,727 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 265 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:26:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 11:26:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-09-25 11:26:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2024-09-25 11:26:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-09-25 11:26:18,739 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2024-09-25 11:26:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:18,739 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-09-25 11:26:18,740 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:26:18,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-09-25 11:26:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-25 11:26:18,741 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:18,741 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:18,758 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 11:26:18,945 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:18,946 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:18,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash 732902042, now seen corresponding path program 1 times [2024-09-25 11:26:18,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:18,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912501867] [2024-09-25 11:26:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:18,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:18,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:18,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:26:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912501867] [2024-09-25 11:26:19,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912501867] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:19,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027588041] [2024-09-25 11:26:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:19,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:19,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:19,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:26:19,098 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 11:26:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 11:26:19,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:26:19,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:26:19,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027588041] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:26:19,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:26:19,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2024-09-25 11:26:19,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063975392] [2024-09-25 11:26:19,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:26:19,209 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 11:26:19,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:19,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 11:26:19,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-09-25 11:26:19,210 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 11:26:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:19,324 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2024-09-25 11:26:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:26:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-09-25 11:26:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:19,326 INFO L225 Difference]: With dead ends: 46 [2024-09-25 11:26:19,326 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 11:26:19,326 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-09-25 11:26:19,327 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:19,327 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:26:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 11:26:19,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-09-25 11:26:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2024-09-25 11:26:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-09-25 11:26:19,354 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 28 [2024-09-25 11:26:19,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:19,354 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-09-25 11:26:19,355 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 11:26:19,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-09-25 11:26:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 11:26:19,356 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:19,357 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:19,373 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 11:26:19,561 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:19,562 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:19,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash -925704228, now seen corresponding path program 1 times [2024-09-25 11:26:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730966146] [2024-09-25 11:26:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:19,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 11:26:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 11:26:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:26:19,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730966146] [2024-09-25 11:26:19,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730966146] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822740157] [2024-09-25 11:26:19,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:19,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:19,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:19,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:26:19,700 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:26:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:19,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 11:26:19,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:19,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 11:26:19,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 11:26:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822740157] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:20,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:20,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2024-09-25 11:26:20,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092694875] [2024-09-25 11:26:20,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:20,128 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 11:26:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:20,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 11:26:20,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-09-25 11:26:20,129 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-25 11:26:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:20,276 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2024-09-25 11:26:20,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:26:20,276 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) Word has length 39 [2024-09-25 11:26:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:20,277 INFO L225 Difference]: With dead ends: 71 [2024-09-25 11:26:20,277 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:26:20,278 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-09-25 11:26:20,278 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:20,279 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 195 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:26:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:26:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:26:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 11:26:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:26:20,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-09-25 11:26:20,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:20,280 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:26:20,280 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 16 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-25 11:26:20,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:26:20,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:26:20,283 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:26:20,299 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:26:20,483 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:20,487 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-25 11:26:20,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:26:20,899 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:26:20,911 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:26:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:26:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:26:20,912 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:26:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:26:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:26:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:26:20,913 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:26:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:26:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:26:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:26:20,916 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:26:20,917 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:26:20,917 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:26:20,917 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:26:20,917 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:26:20,920 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:26:20,920 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:26:20,920 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:26:20,920 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:26:20,920 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:26:20,920 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:26:20,920 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:26:20,920 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:26:20,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:26:20 BoogieIcfgContainer [2024-09-25 11:26:20,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:26:20,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:26:20,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:26:20,922 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:26:20,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:26:16" (3/4) ... [2024-09-25 11:26:20,924 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:26:20,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:26:20,973 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:26:20,974 INFO L158 Benchmark]: Toolchain (without parser) took 5206.09ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.6MB in the beginning and 47.5MB in the end (delta: -4.9MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-09-25 11:26:20,976 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:26:20,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.93ms. Allocated memory is still 75.5MB. Free memory was 42.4MB in the beginning and 51.2MB in the end (delta: -8.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-09-25 11:26:20,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.57ms. Allocated memory is still 75.5MB. Free memory was 51.2MB in the beginning and 50.3MB in the end (delta: 912.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:26:20,977 INFO L158 Benchmark]: Boogie Preprocessor took 28.40ms. Allocated memory is still 75.5MB. Free memory was 50.3MB in the beginning and 48.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:26:20,977 INFO L158 Benchmark]: RCFGBuilder took 318.20ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 36.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 11:26:20,978 INFO L158 Benchmark]: TraceAbstraction took 4539.98ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 36.0MB in the beginning and 49.6MB in the end (delta: -13.6MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-09-25 11:26:20,978 INFO L158 Benchmark]: Witness Printer took 51.47ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 47.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:26:20,980 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.93ms. Allocated memory is still 75.5MB. Free memory was 42.4MB in the beginning and 51.2MB in the end (delta: -8.8MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.57ms. Allocated memory is still 75.5MB. Free memory was 51.2MB in the beginning and 50.3MB in the end (delta: 912.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.40ms. Allocated memory is still 75.5MB. Free memory was 50.3MB in the beginning and 48.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 318.20ms. Allocated memory is still 75.5MB. Free memory was 48.6MB in the beginning and 36.6MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4539.98ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 36.0MB in the beginning and 49.6MB in the end (delta: -13.6MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Witness Printer took 51.47ms. Allocated memory is still 92.3MB. Free memory was 49.6MB in the beginning and 47.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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 - PositiveResult [Line: 41]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 944 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 773 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 514 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 171 mSDtfsCounter, 514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 242 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, InterpolantAutomatonStates: 45, 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, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 346 ConstructedInterpolants, 0 QuantifiedInterpolants, 673 SizeOfPredicates, 5 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 50/82 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 19]: Procedure Contract for fibo2 Derived contract for procedure fibo2. Ensures: (((\result == 1) || (n != 1)) && ((\result == 0) || (0 < n))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: ((2 != n) || (\result == 1)) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:26:21,006 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE