./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.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_5-1.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 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 --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:46,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:26:46,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:26:46,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:26:46,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:26:46,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:26:46,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:26:46,657 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:26:46,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:26:46,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:26:46,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:26:46,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:26:46,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:26:46,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:26:46,661 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:26:46,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:26:46,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:26:46,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:26:46,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:26:46,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:26:46,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:26:46,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:26:46,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:26:46,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:26:46,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:26:46,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:26:46,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:26:46,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:26:46,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:26:46,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:26:46,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:26:46,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:26:46,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:26:46,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:26:46,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:26:46,668 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:26:46,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:26:46,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:26:46,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:26:46,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:26:46,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:26:46,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:26:46,673 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 -> 24cc882af4ec42ba94c424c5a1ed92d402543c0fe2bf17d3fca0ca1cd73500b7 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:46,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:26:47,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:26:47,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:26:47,020 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:26:47,020 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:26:47,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-09-25 11:26:48,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:26:48,710 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:26:48,711 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2024-09-25 11:26:48,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6d86f6f94/4b66fc90f3ed4c348fcf5a0059eaeec2/FLAG0e120ae50 [2024-09-25 11:26:48,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6d86f6f94/4b66fc90f3ed4c348fcf5a0059eaeec2 [2024-09-25 11:26:48,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:26:48,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:26:48,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:26:48,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:26:48,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:26:48,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:26:48" (1/1) ... [2024-09-25 11:26:48,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f69076f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:48, skipping insertion in model container [2024-09-25 11:26:48,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:26:48" (1/1) ... [2024-09-25 11:26:48,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:26:48,946 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c[946,959] [2024-09-25 11:26:48,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:26:48,964 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:26:48,980 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c[946,959] [2024-09-25 11:26:48,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:26:48,998 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:26:49,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:49 WrapperNode [2024-09-25 11:26:49,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:26:49,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:26:49,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:26:49,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:26:49,011 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:49" (1/1) ... [2024-09-25 11:26:49,018 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:49" (1/1) ... [2024-09-25 11:26:49,024 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:26:49,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:26:49,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:26:49,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:26:49,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:26:49,033 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:49" (1/1) ... [2024-09-25 11:26:49,033 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:49" (1/1) ... [2024-09-25 11:26:49,034 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:49" (1/1) ... [2024-09-25 11:26:49,047 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:49,047 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:49" (1/1) ... [2024-09-25 11:26:49,047 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:49" (1/1) ... [2024-09-25 11:26:49,050 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:49" (1/1) ... [2024-09-25 11:26:49,051 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:49" (1/1) ... [2024-09-25 11:26:49,052 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:49" (1/1) ... [2024-09-25 11:26:49,052 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:49" (1/1) ... [2024-09-25 11:26:49,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:26:49,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:26:49,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:26:49,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:26:49,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:49" (1/1) ... [2024-09-25 11:26:49,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:26:49,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:49,088 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:49,090 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:49,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:26:49,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:26:49,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:26:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:26:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-09-25 11:26:49,130 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-09-25 11:26:49,130 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-09-25 11:26:49,132 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-09-25 11:26:49,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:26:49,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:26:49,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:26:49,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:26:49,182 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:26:49,184 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:26:49,327 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-25 11:26:49,327 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:26:49,360 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:26:49,361 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:26:49,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:26:49 BoogieIcfgContainer [2024-09-25 11:26:49,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:26:49,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:26:49,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:26:49,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:26:49,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:26:48" (1/3) ... [2024-09-25 11:26:49,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53003d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:26:49, skipping insertion in model container [2024-09-25 11:26:49,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:26:49" (2/3) ... [2024-09-25 11:26:49,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53003d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:26:49, skipping insertion in model container [2024-09-25 11:26:49,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:26:49" (3/3) ... [2024-09-25 11:26:49,376 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2024-09-25 11:26:49,393 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:26:49,394 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:26:49,463 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:26:49,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;@8e074a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:26:49,471 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:26:49,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:49,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 11:26:49,482 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:49,483 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:49,483 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:49,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash -685851838, now seen corresponding path program 1 times [2024-09-25 11:26:49,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815686752] [2024-09-25 11:26:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:49,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:49,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:49,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:49,796 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:49,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815686752] [2024-09-25 11:26:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815686752] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:26:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:26:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:26:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534642823] [2024-09-25 11:26:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:26:49,808 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:26:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:49,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:26:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:26:49,836 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:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:49,949 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-09-25 11:26:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:26:49,953 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:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:49,961 INFO L225 Difference]: With dead ends: 44 [2024-09-25 11:26:49,962 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:26:49,964 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:49,968 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:49,970 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:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:26:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 11:26:50,011 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:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-25 11:26:50,015 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2024-09-25 11:26:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:50,016 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-25 11:26:50,017 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:50,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:50,018 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-25 11:26:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 11:26:50,020 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:50,020 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:50,021 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:26:50,021 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:50,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 924954813, now seen corresponding path program 1 times [2024-09-25 11:26:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:50,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15952722] [2024-09-25 11:26:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:50,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,149 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:50,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:50,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15952722] [2024-09-25 11:26:50,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15952722] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:26:50,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:26:50,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:26:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120293616] [2024-09-25 11:26:50,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:26:50,152 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:26:50,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:50,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:26:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:26:50,156 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:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:50,231 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-09-25 11:26:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:26:50,232 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:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:50,237 INFO L225 Difference]: With dead ends: 36 [2024-09-25 11:26:50,237 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:26:50,238 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:50,239 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:50,239 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:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:26:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 11:26:50,253 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:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-09-25 11:26:50,258 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2024-09-25 11:26:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:50,259 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-09-25 11:26:50,259 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:50,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-09-25 11:26:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 11:26:50,261 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:50,261 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:50,261 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:26:50,261 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:50,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:50,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1782416332, now seen corresponding path program 1 times [2024-09-25 11:26:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:50,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85025595] [2024-09-25 11:26:50,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:50,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 11:26:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,447 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:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85025595] [2024-09-25 11:26:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85025595] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92555492] [2024-09-25 11:26:50,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:50,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:50,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:50,451 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:50,453 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:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:50,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 11:26:50,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:50,611 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:50,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:50,870 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:50,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92555492] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:50,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:50,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-09-25 11:26:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292127500] [2024-09-25 11:26:50,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:50,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 11:26:50,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:50,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 11:26:50,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-25 11:26:50,877 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-25 11:26:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:51,066 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-09-25 11:26:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:26:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 26 [2024-09-25 11:26:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:51,068 INFO L225 Difference]: With dead ends: 58 [2024-09-25 11:26:51,068 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 11:26:51,069 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:26:51,070 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:51,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 160 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:26:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 11:26:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2024-09-25 11:26:51,087 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:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-25 11:26:51,088 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2024-09-25 11:26:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:51,088 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-25 11:26:51,089 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.2) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-25 11:26:51,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-25 11:26:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:26:51,090 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:51,090 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:51,106 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:51,297 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:51,298 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:51,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash -836643613, now seen corresponding path program 1 times [2024-09-25 11:26:51,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:51,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291564533] [2024-09-25 11:26:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:51,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:51,349 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:51,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:51,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:51,473 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:51,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291564533] [2024-09-25 11:26:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291564533] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856674148] [2024-09-25 11:26:51,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:51,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:51,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:51,480 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:51,482 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:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:51,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 11:26:51,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:51,578 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:51,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:51,763 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:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856674148] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:51,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-09-25 11:26:51,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715059477] [2024-09-25 11:26:51,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:51,764 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 11:26:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:51,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 11:26:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-25 11:26:51,766 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:26:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:51,953 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-09-25 11:26:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:26:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Word has length 27 [2024-09-25 11:26:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:51,956 INFO L225 Difference]: With dead ends: 56 [2024-09-25 11:26:51,958 INFO L226 Difference]: Without dead ends: 52 [2024-09-25 11:26:51,958 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-09-25 11:26:51,960 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:51,961 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 182 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:26:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-25 11:26:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-09-25 11:26:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 11:26:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-09-25 11:26:51,980 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 27 [2024-09-25 11:26:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:51,980 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-09-25 11:26:51,980 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 13 states have internal predecessors, (32), 8 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:26:51,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-09-25 11:26:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-25 11:26:51,982 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:51,982 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:51,999 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 11:26:52,183 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:52,183 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:52,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash -925704228, now seen corresponding path program 1 times [2024-09-25 11:26:52,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:52,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861826385] [2024-09-25 11:26:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:52,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:52,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:52,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:52,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:52,307 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-25 11:26:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:52,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 11:26:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:52,314 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:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:52,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861826385] [2024-09-25 11:26:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861826385] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:52,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6572559] [2024-09-25 11:26:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:52,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:52,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:52,317 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:52,319 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:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:52,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 11:26:52,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 11:26:52,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:26:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6572559] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:52,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:52,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2024-09-25 11:26:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140239838] [2024-09-25 11:26:52,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:52,805 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 11:26:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 11:26:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:26:52,806 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 11:26:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:53,060 INFO L93 Difference]: Finished difference Result 112 states and 180 transitions. [2024-09-25 11:26:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 11:26:53,061 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) Word has length 39 [2024-09-25 11:26:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:53,063 INFO L225 Difference]: With dead ends: 112 [2024-09-25 11:26:53,066 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 11:26:53,067 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-25 11:26:53,069 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:53,070 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 200 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:26:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 11:26:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-09-25 11:26:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (30), 14 states have call predecessors, (30), 13 states have call successors, (30) [2024-09-25 11:26:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2024-09-25 11:26:53,089 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2024-09-25 11:26:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:53,089 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2024-09-25 11:26:53,089 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 15 states have internal predecessors, (47), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 11:26:53,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2024-09-25 11:26:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 11:26:53,092 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:53,092 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, 1] [2024-09-25 11:26:53,108 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:53,295 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:53,296 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:53,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:53,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1261961157, now seen corresponding path program 1 times [2024-09-25 11:26:53,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:53,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147992952] [2024-09-25 11:26:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:53,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:53,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:53,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:53,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:53,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:53,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:26:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-25 11:26:53,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:53,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147992952] [2024-09-25 11:26:53,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147992952] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:53,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614056690] [2024-09-25 11:26:53,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:53,494 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:53,496 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:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:53,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 11:26:53,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 11:26:53,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:26:53,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614056690] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:53,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:53,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2024-09-25 11:26:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385508199] [2024-09-25 11:26:53,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:53,950 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 11:26:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 11:26:53,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-09-25 11:26:53,951 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 11:26:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:54,284 INFO L93 Difference]: Finished difference Result 182 states and 328 transitions. [2024-09-25 11:26:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 11:26:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) Word has length 40 [2024-09-25 11:26:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:54,288 INFO L225 Difference]: With dead ends: 182 [2024-09-25 11:26:54,288 INFO L226 Difference]: Without dead ends: 122 [2024-09-25 11:26:54,290 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2024-09-25 11:26:54,290 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:54,291 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 343 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:26:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-25 11:26:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2024-09-25 11:26:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.21875) internal successors, (78), 67 states have internal predecessors, (78), 23 states have call successors, (23), 9 states have call predecessors, (23), 15 states have return successors, (64), 26 states have call predecessors, (64), 22 states have call successors, (64) [2024-09-25 11:26:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 165 transitions. [2024-09-25 11:26:54,318 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 165 transitions. Word has length 40 [2024-09-25 11:26:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:54,318 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 165 transitions. [2024-09-25 11:26:54,319 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 11:26:54,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 165 transitions. [2024-09-25 11:26:54,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 11:26:54,322 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:54,322 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:54,338 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:54,526 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:54,527 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:54,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:54,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1624375296, now seen corresponding path program 1 times [2024-09-25 11:26:54,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:54,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199221811] [2024-09-25 11:26:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:54,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:26:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,773 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-25 11:26:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-25 11:26:54,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:54,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199221811] [2024-09-25 11:26:54,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199221811] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:54,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226372208] [2024-09-25 11:26:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:54,778 INFO L229 MonitoredProcess]: Starting monitored process 6 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:54,779 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:26:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:54,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 11:26:54,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-25 11:26:54,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:26:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226372208] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:55,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:55,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 19 [2024-09-25 11:26:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689091680] [2024-09-25 11:26:55,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:55,434 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 11:26:55,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:55,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 11:26:55,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:26:55,435 INFO L87 Difference]: Start difference. First operand 103 states and 165 transitions. Second operand has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (18), 8 states have call predecessors, (18), 13 states have call successors, (18) [2024-09-25 11:26:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:55,828 INFO L93 Difference]: Finished difference Result 252 states and 489 transitions. [2024-09-25 11:26:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-25 11:26:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (18), 8 states have call predecessors, (18), 13 states have call successors, (18) Word has length 54 [2024-09-25 11:26:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:55,836 INFO L225 Difference]: With dead ends: 252 [2024-09-25 11:26:55,836 INFO L226 Difference]: Without dead ends: 155 [2024-09-25 11:26:55,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2024-09-25 11:26:55,838 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:55,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 348 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:26:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-09-25 11:26:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 112. [2024-09-25 11:26:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (67), 28 states have call predecessors, (67), 25 states have call successors, (67) [2024-09-25 11:26:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2024-09-25 11:26:55,868 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2024-09-25 11:26:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:55,869 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2024-09-25 11:26:55,869 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 13 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (18), 8 states have call predecessors, (18), 13 states have call successors, (18) [2024-09-25 11:26:55,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2024-09-25 11:26:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-25 11:26:55,872 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:55,873 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:55,889 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 11:26:56,073 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 11:26:56,074 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:56,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2073072172, now seen corresponding path program 1 times [2024-09-25 11:26:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:56,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069377399] [2024-09-25 11:26:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:56,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,139 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:26:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:26:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 11:26:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-09-25 11:26:56,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069377399] [2024-09-25 11:26:56,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069377399] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054096254] [2024-09-25 11:26:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:56,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:56,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:56,375 INFO L229 MonitoredProcess]: Starting monitored process 7 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:56,377 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 11:26:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:56,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 11:26:56,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 31 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-09-25 11:26:56,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 31 proven. 33 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-09-25 11:26:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054096254] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:56,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 19 [2024-09-25 11:26:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901120454] [2024-09-25 11:26:56,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:56,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 11:26:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:56,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 11:26:56,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:26:56,911 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2024-09-25 11:26:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:26:57,266 INFO L93 Difference]: Finished difference Result 254 states and 496 transitions. [2024-09-25 11:26:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 11:26:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) Word has length 82 [2024-09-25 11:26:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:26:57,270 INFO L225 Difference]: With dead ends: 254 [2024-09-25 11:26:57,270 INFO L226 Difference]: Without dead ends: 137 [2024-09-25 11:26:57,272 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-09-25 11:26:57,272 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:26:57,272 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 264 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:26:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-09-25 11:26:57,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2024-09-25 11:26:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 75 states have internal predecessors, (91), 25 states have call successors, (25), 13 states have call predecessors, (25), 14 states have return successors, (61), 25 states have call predecessors, (61), 24 states have call successors, (61) [2024-09-25 11:26:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 177 transitions. [2024-09-25 11:26:57,317 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 177 transitions. Word has length 82 [2024-09-25 11:26:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:26:57,318 INFO L474 AbstractCegarLoop]: Abstraction has 114 states and 177 transitions. [2024-09-25 11:26:57,318 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2024-09-25 11:26:57,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 177 transitions. [2024-09-25 11:26:57,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-09-25 11:26:57,321 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:26:57,321 INFO L216 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 13, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:26:57,338 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 11:26:57,525 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:57,526 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:26:57,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:26:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 146808360, now seen corresponding path program 1 times [2024-09-25 11:26:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:26:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735023505] [2024-09-25 11:26:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:57,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:26:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:57,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:26:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:57,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:26:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:57,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:57,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:57,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:57,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,010 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:26:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:26:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:26:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-09-25 11:26:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:26:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:26:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:26:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:26:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:26:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 11:26:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 183 proven. 290 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-25 11:26:58,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:26:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735023505] [2024-09-25 11:26:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735023505] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:26:58,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121930355] [2024-09-25 11:26:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:26:58,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:26:58,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:26:58,321 INFO L229 MonitoredProcess]: Starting monitored process 8 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:58,323 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 11:26:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:26:58,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 11:26:58,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:26:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 92 proven. 230 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2024-09-25 11:26:58,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:26:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 92 proven. 238 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2024-09-25 11:26:59,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121930355] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:26:59,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:26:59,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 13] total 32 [2024-09-25 11:26:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828493383] [2024-09-25 11:26:59,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:26:59,542 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 11:26:59,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:26:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 11:26:59,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2024-09-25 11:26:59,544 INFO L87 Difference]: Start difference. First operand 114 states and 177 transitions. Second operand has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 20 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 20 states have call predecessors, (34), 20 states have call successors, (34) [2024-09-25 11:27:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:00,239 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2024-09-25 11:27:00,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-09-25 11:27:00,240 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 20 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 20 states have call predecessors, (34), 20 states have call successors, (34) Word has length 205 [2024-09-25 11:27:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:00,242 INFO L225 Difference]: With dead ends: 244 [2024-09-25 11:27:00,242 INFO L226 Difference]: Without dead ends: 116 [2024-09-25 11:27:00,244 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 453 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1987, Unknown=0, NotChecked=0, Total=2352 [2024-09-25 11:27:00,245 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:00,245 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 482 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 11:27:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-25 11:27:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2024-09-25 11:27:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 66 states have internal predecessors, (82), 19 states have call successors, (19), 14 states have call predecessors, (19), 12 states have return successors, (35), 17 states have call predecessors, (35), 18 states have call successors, (35) [2024-09-25 11:27:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-09-25 11:27:00,260 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 205 [2024-09-25 11:27:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:00,260 INFO L474 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-09-25 11:27:00,261 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.903225806451613) internal successors, (90), 32 states have internal predecessors, (90), 20 states have call successors, (28), 1 states have call predecessors, (28), 14 states have return successors, (34), 20 states have call predecessors, (34), 20 states have call successors, (34) [2024-09-25 11:27:00,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-09-25 11:27:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-09-25 11:27:00,262 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:00,262 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:00,279 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 11:27:00,464 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:00,465 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:00,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1761300740, now seen corresponding path program 2 times [2024-09-25 11:27:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:00,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169284995] [2024-09-25 11:27:00,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 11:27:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 79 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-09-25 11:27:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169284995] [2024-09-25 11:27:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169284995] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416234055] [2024-09-25 11:27:00,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:27:00,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:00,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:00,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:27:00,751 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 11:27:00,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:27:00,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:00,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 11:27:00,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-09-25 11:27:00,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-09-25 11:27:01,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416234055] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:01,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:01,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 19 [2024-09-25 11:27:01,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633946153] [2024-09-25 11:27:01,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:01,172 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 11:27:01,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:01,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 11:27:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:27:01,173 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) [2024-09-25 11:27:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:01,368 INFO L93 Difference]: Finished difference Result 194 states and 277 transitions. [2024-09-25 11:27:01,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 11:27:01,369 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) Word has length 95 [2024-09-25 11:27:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:01,370 INFO L225 Difference]: With dead ends: 194 [2024-09-25 11:27:01,370 INFO L226 Difference]: Without dead ends: 109 [2024-09-25 11:27:01,371 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:27:01,372 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:01,372 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 229 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:27:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-25 11:27:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2024-09-25 11:27:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 69 states have internal predecessors, (86), 20 states have call successors, (20), 15 states have call predecessors, (20), 12 states have return successors, (33), 18 states have call predecessors, (33), 19 states have call successors, (33) [2024-09-25 11:27:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2024-09-25 11:27:01,392 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 95 [2024-09-25 11:27:01,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:01,392 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2024-09-25 11:27:01,392 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 11 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) [2024-09-25 11:27:01,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:01,393 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-09-25 11:27:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-25 11:27:01,394 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:01,394 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:01,411 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 11:27:01,595 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:01,595 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:01,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash 719095213, now seen corresponding path program 3 times [2024-09-25 11:27:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539654363] [2024-09-25 11:27:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:01,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:01,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:01,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 11:27:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,356 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,385 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-25 11:27:02,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:02,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539654363] [2024-09-25 11:27:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539654363] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:02,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128929509] [2024-09-25 11:27:02,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:27:02,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:02,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:02,394 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:27:02,396 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 11:27:02,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-25 11:27:02,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:02,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-25 11:27:02,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-25 11:27:02,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-25 11:27:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128929509] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:03,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 28 [2024-09-25 11:27:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130739605] [2024-09-25 11:27:03,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:03,127 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-25 11:27:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:03,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-25 11:27:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2024-09-25 11:27:03,129 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (18), 18 states have call predecessors, (18), 5 states have call successors, (18) [2024-09-25 11:27:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:03,284 INFO L93 Difference]: Finished difference Result 137 states and 193 transitions. [2024-09-25 11:27:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-25 11:27:03,284 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (18), 18 states have call predecessors, (18), 5 states have call successors, (18) Word has length 109 [2024-09-25 11:27:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:03,287 INFO L225 Difference]: With dead ends: 137 [2024-09-25 11:27:03,287 INFO L226 Difference]: Without dead ends: 133 [2024-09-25 11:27:03,288 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2024-09-25 11:27:03,288 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:03,288 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1012 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:27:03,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-09-25 11:27:03,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2024-09-25 11:27:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 82 states have internal predecessors, (99), 23 states have call successors, (23), 15 states have call predecessors, (23), 17 states have return successors, (54), 26 states have call predecessors, (54), 22 states have call successors, (54) [2024-09-25 11:27:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2024-09-25 11:27:03,316 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 109 [2024-09-25 11:27:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:03,317 INFO L474 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2024-09-25 11:27:03,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 15 states have internal predecessors, (39), 5 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (18), 18 states have call predecessors, (18), 5 states have call successors, (18) [2024-09-25 11:27:03,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2024-09-25 11:27:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-09-25 11:27:03,320 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:03,320 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:03,338 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-25 11:27:03,520 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 11:27:03,521 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:03,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:03,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1579294066, now seen corresponding path program 4 times [2024-09-25 11:27:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:03,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072274487] [2024-09-25 11:27:03,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:03,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,775 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-09-25 11:27:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 58 proven. 98 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-09-25 11:27:03,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072274487] [2024-09-25 11:27:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072274487] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:03,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041540128] [2024-09-25 11:27:03,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 11:27:03,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:03,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:03,855 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:27:03,857 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 11:27:03,923 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 11:27:03,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:03,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 11:27:03,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 55 proven. 61 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-09-25 11:27:04,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 57 proven. 63 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-09-25 11:27:04,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041540128] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:04,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:04,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 11] total 24 [2024-09-25 11:27:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226293757] [2024-09-25 11:27:04,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:04,569 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 11:27:04,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:04,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 11:27:04,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2024-09-25 11:27:04,571 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) [2024-09-25 11:27:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:04,904 INFO L93 Difference]: Finished difference Result 240 states and 354 transitions. [2024-09-25 11:27:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-25 11:27:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) Word has length 110 [2024-09-25 11:27:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:04,907 INFO L225 Difference]: With dead ends: 240 [2024-09-25 11:27:04,907 INFO L226 Difference]: Without dead ends: 129 [2024-09-25 11:27:04,908 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 240 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 11:27:04,909 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:04,909 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 308 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:27:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-25 11:27:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2024-09-25 11:27:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 78 states have (on average 1.205128205128205) internal successors, (94), 77 states have internal predecessors, (94), 22 states have call successors, (22), 15 states have call predecessors, (22), 15 states have return successors, (39), 23 states have call predecessors, (39), 21 states have call successors, (39) [2024-09-25 11:27:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 155 transitions. [2024-09-25 11:27:04,925 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 155 transitions. Word has length 110 [2024-09-25 11:27:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:04,925 INFO L474 AbstractCegarLoop]: Abstraction has 116 states and 155 transitions. [2024-09-25 11:27:04,925 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.347826086956522) internal successors, (77), 24 states have internal predecessors, (77), 15 states have call successors, (24), 1 states have call predecessors, (24), 10 states have return successors, (28), 15 states have call predecessors, (28), 15 states have call successors, (28) [2024-09-25 11:27:04,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 155 transitions. [2024-09-25 11:27:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-09-25 11:27:04,927 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:04,927 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:04,945 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-25 11:27:05,131 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 11:27:05,132 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:05,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash -273902236, now seen corresponding path program 1 times [2024-09-25 11:27:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:05,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041631616] [2024-09-25 11:27:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,211 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,422 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 11:27:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-09-25 11:27:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,449 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-09-25 11:27:05,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:05,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041631616] [2024-09-25 11:27:05,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041631616] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:05,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296231669] [2024-09-25 11:27:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:05,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:05,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:05,455 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:27:05,457 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 11:27:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:05,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 11:27:05,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 133 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-09-25 11:27:05,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 147 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-09-25 11:27:06,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296231669] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:06,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:06,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 24 [2024-09-25 11:27:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456706181] [2024-09-25 11:27:06,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:06,813 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 11:27:06,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:06,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 11:27:06,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-09-25 11:27:06,814 INFO L87 Difference]: Start difference. First operand 116 states and 155 transitions. Second operand has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 19 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 10 states have call predecessors, (32), 19 states have call successors, (32) [2024-09-25 11:27:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:07,120 INFO L93 Difference]: Finished difference Result 229 states and 318 transitions. [2024-09-25 11:27:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 11:27:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 19 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 10 states have call predecessors, (32), 19 states have call successors, (32) Word has length 123 [2024-09-25 11:27:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:07,123 INFO L225 Difference]: With dead ends: 229 [2024-09-25 11:27:07,123 INFO L226 Difference]: Without dead ends: 84 [2024-09-25 11:27:07,124 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 265 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2024-09-25 11:27:07,124 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:07,125 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 485 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:27:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-25 11:27:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-09-25 11:27:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 57 states have internal predecessors, (69), 15 states have call successors, (15), 14 states have call predecessors, (15), 10 states have return successors, (15), 12 states have call predecessors, (15), 14 states have call successors, (15) [2024-09-25 11:27:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-09-25 11:27:07,134 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 123 [2024-09-25 11:27:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:07,135 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-09-25 11:27:07,135 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 19 states have call successors, (26), 1 states have call predecessors, (26), 9 states have return successors, (32), 10 states have call predecessors, (32), 19 states have call successors, (32) [2024-09-25 11:27:07,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-09-25 11:27:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-09-25 11:27:07,137 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:07,137 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:07,153 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-25 11:27:07,340 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:07,341 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:07,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:07,341 INFO L85 PathProgramCache]: Analyzing trace with hash -543433254, now seen corresponding path program 5 times [2024-09-25 11:27:07,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:07,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548608562] [2024-09-25 11:27:07,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:07,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 11:27:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:27:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:27:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:27:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 11:27:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:07,809 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 92 proven. 147 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-09-25 11:27:07,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:07,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548608562] [2024-09-25 11:27:07,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548608562] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:07,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769383118] [2024-09-25 11:27:07,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 11:27:07,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:07,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:07,813 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:27:07,814 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-25 11:27:07,904 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-09-25 11:27:07,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:27:07,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 11:27:07,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 105 proven. 126 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-09-25 11:27:08,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 105 proven. 129 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-09-25 11:27:08,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769383118] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:27:08,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:27:08,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 15] total 32 [2024-09-25 11:27:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619850875] [2024-09-25 11:27:08,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:27:08,774 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 11:27:08,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 11:27:08,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2024-09-25 11:27:08,775 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 21 states have call successors, (32), 1 states have call predecessors, (32), 11 states have return successors, (35), 19 states have call predecessors, (35), 21 states have call successors, (35) [2024-09-25 11:27:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:09,103 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2024-09-25 11:27:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-25 11:27:09,104 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 21 states have call successors, (32), 1 states have call predecessors, (32), 11 states have return successors, (35), 19 states have call predecessors, (35), 21 states have call successors, (35) Word has length 136 [2024-09-25 11:27:09,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:09,104 INFO L225 Difference]: With dead ends: 89 [2024-09-25 11:27:09,105 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:27:09,105 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=330, Invalid=1562, Unknown=0, NotChecked=0, Total=1892 [2024-09-25 11:27:09,106 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:09,106 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 313 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:27:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:27:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:27:09,106 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:27:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:27:09,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2024-09-25 11:27:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:09,107 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:27:09,108 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 32 states have internal predecessors, (93), 21 states have call successors, (32), 1 states have call predecessors, (32), 11 states have return successors, (35), 19 states have call predecessors, (35), 21 states have call successors, (35) [2024-09-25 11:27:09,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:27:09,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:27:09,111 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:27:09,124 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-25 11:27:09,315 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 11:27:09,318 INFO L408 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:09,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:27:14,063 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:27:14,076 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:14,076 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:14,077 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:14,077 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:14,077 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:14,077 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:14,077 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:14,078 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:14,082 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:14,082 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:14,082 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:14,083 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:14,083 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:14,083 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:14,084 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:14,084 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:14,095 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:14,095 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:14,095 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:14,095 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:14,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:14,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:14,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:14,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:14,096 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-25 11:27:14,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:27:14 BoogieIcfgContainer [2024-09-25 11:27:14,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:27:14,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:27:14,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:27:14,099 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:27:14,099 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:49" (3/4) ... [2024-09-25 11:27:14,101 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:27:14,154 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:27:14,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:27:14,155 INFO L158 Benchmark]: Toolchain (without parser) took 25412.65ms. Allocated memory was 67.1MB in the beginning and 436.2MB in the end (delta: 369.1MB). Free memory was 36.0MB in the beginning and 185.7MB in the end (delta: -149.7MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. [2024-09-25 11:27:14,155 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 28.6MB in the beginning and 28.5MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:27:14,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.90ms. Allocated memory is still 67.1MB. Free memory was 35.8MB in the beginning and 42.3MB in the end (delta: -6.5MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-09-25 11:27:14,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.02ms. Allocated memory is still 67.1MB. Free memory was 42.3MB in the beginning and 41.4MB in the end (delta: 918.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:27:14,156 INFO L158 Benchmark]: Boogie Preprocessor took 32.78ms. Allocated memory is still 67.1MB. Free memory was 41.4MB in the beginning and 39.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:27:14,156 INFO L158 Benchmark]: RCFGBuilder took 303.97ms. Allocated memory is still 67.1MB. Free memory was 39.6MB in the beginning and 45.3MB in the end (delta: -5.7MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-09-25 11:27:14,157 INFO L158 Benchmark]: TraceAbstraction took 24729.98ms. Allocated memory was 67.1MB in the beginning and 436.2MB in the end (delta: 369.1MB). Free memory was 44.7MB in the beginning and 187.8MB in the end (delta: -143.1MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. [2024-09-25 11:27:14,157 INFO L158 Benchmark]: Witness Printer took 55.94ms. Allocated memory is still 436.2MB. Free memory was 187.8MB in the beginning and 185.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:27:14,162 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.17ms. Allocated memory is still 48.2MB. Free memory was 28.6MB in the beginning and 28.5MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.90ms. Allocated memory is still 67.1MB. Free memory was 35.8MB in the beginning and 42.3MB in the end (delta: -6.5MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.02ms. Allocated memory is still 67.1MB. Free memory was 42.3MB in the beginning and 41.4MB in the end (delta: 918.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.78ms. Allocated memory is still 67.1MB. Free memory was 41.4MB in the beginning and 39.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 303.97ms. Allocated memory is still 67.1MB. Free memory was 39.6MB in the beginning and 45.3MB in the end (delta: -5.7MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24729.98ms. Allocated memory was 67.1MB in the beginning and 436.2MB in the end (delta: 369.1MB). Free memory was 44.7MB in the beginning and 187.8MB in the end (delta: -143.1MB). Peak memory consumption was 265.8MB. Max. memory is 16.1GB. * Witness Printer took 55.94ms. Allocated memory is still 436.2MB. Free memory was 187.8MB in the beginning and 185.7MB 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 19.9s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 531 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 457 mSDsluCounter, 4517 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4076 mSDsCounter, 426 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4924 IncrementalHoareTripleChecker+Invalid, 5350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 426 mSolverCounterUnsat, 441 mSDtfsCounter, 4924 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2661 GetRequests, 2299 SyntacticMatches, 48 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=11, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 141 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 2119 NumberOfCodeBlocks, 2051 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3127 ConstructedInterpolants, 0 QuantifiedInterpolants, 5927 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2351 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 6168/8469 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)) || (2 < n)) && ((((((2 == \result) && (3 == n)) || ((\result == 1) && (n == 1))) || ((3 == \result) && (n == 4))) || (4 < n)) || (n < 1))) - ProcedureContractResult [Line: 9]: Procedure Contract for fibo1 Derived contract for procedure fibo1. Ensures: ((((\result == 0) || (1 < n)) || (n == 1)) && ((n != 1) || (\result == 1))) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:27:14,189 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