./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 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/id_i10_o10-2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3f8ee4f5181b3404c1367dbf131683f1e761cea6b176154f687b628466c991fe --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:09:14,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:09:14,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:09:14,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:09:14,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:09:14,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:09:14,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:09:14,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:09:14,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:09:14,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:09:14,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:09:14,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:09:14,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:09:14,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:09:14,343 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:09:14,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:09:14,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:09:14,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:09:14,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:09:14,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:09:14,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:09:14,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:09:14,350 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:09:14,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:09:14,351 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:09:14,351 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:09:14,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:09:14,351 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:09:14,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:09:14,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:09:14,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:09:14,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:09:14,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:14,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:09:14,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:09:14,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:09:14,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:09:14,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:09:14,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:09:14,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:09:14,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:09:14,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:09:14,356 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 -> 3f8ee4f5181b3404c1367dbf131683f1e761cea6b176154f687b628466c991fe 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:09:14,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:09:14,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:09:14,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:09:14,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:09:14,680 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:09:14,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2024-09-25 00:09:16,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:09:16,359 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:09:16,359 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2024-09-25 00:09:16,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/2e46998a9/397c97edd3e746d8a893eb191f1097e5/FLAGca104d7fc [2024-09-25 00:09:16,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/2e46998a9/397c97edd3e746d8a893eb191f1097e5 [2024-09-25 00:09:16,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:09:16,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:09:16,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:16,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:09:16,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:09:16,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd1c598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16, skipping insertion in model container [2024-09-25 00:09:16,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:09:16,592 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/id_i10_o10-2.c[454,467] [2024-09-25 00:09:16,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:16,605 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:09:16,637 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/id_i10_o10-2.c[454,467] [2024-09-25 00:09:16,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:16,657 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:09:16,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16 WrapperNode [2024-09-25 00:09:16,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:16,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:16,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:09:16,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:09:16,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,686 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:09:16,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:16,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:09:16,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:09:16,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:09:16,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,708 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 00:09:16,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:09:16,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:09:16,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:09:16,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:09:16,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (1/1) ... [2024-09-25 00:09:16,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:16,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:16,752 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 00:09:16,755 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 00:09:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:09:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:09:16,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:09:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:09:16,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:09:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:09:16,806 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:09:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:09:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-25 00:09:16,808 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-25 00:09:16,875 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:09:16,877 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:09:17,026 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 00:09:17,028 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:09:17,059 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:09:17,062 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:09:17,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:17 BoogieIcfgContainer [2024-09-25 00:09:17,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:09:17,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:09:17,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:09:17,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:09:17,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:09:16" (1/3) ... [2024-09-25 00:09:17,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0dd0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:17, skipping insertion in model container [2024-09-25 00:09:17,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:16" (2/3) ... [2024-09-25 00:09:17,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0dd0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:17, skipping insertion in model container [2024-09-25 00:09:17,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:17" (3/3) ... [2024-09-25 00:09:17,075 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2024-09-25 00:09:17,095 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:09:17,096 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:09:17,162 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:09:17,170 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;@6352b228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:09:17,170 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:09:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 00:09:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 00:09:17,183 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:17,184 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:17,184 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:17,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:17,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2082045565, now seen corresponding path program 1 times [2024-09-25 00:09:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914740034] [2024-09-25 00:09:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:17,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:17,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:17,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:17,505 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 00:09:17,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:17,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914740034] [2024-09-25 00:09:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914740034] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:17,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:09:17,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:09:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866548028] [2024-09-25 00:09:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:17,516 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:09:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:17,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:09:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:09:17,542 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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 00:09:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:17,597 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-09-25 00:09:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:09:17,600 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 00:09:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:17,607 INFO L225 Difference]: With dead ends: 30 [2024-09-25 00:09:17,608 INFO L226 Difference]: Without dead ends: 18 [2024-09-25 00:09:17,610 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 00:09:17,614 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:17,615 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-25 00:09:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-25 00:09:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:09:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-09-25 00:09:17,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2024-09-25 00:09:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:17,655 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-09-25 00:09:17,656 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 00:09:17,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-09-25 00:09:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 00:09:17,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:17,658 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:17,658 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:09:17,659 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:17,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash -799337521, now seen corresponding path program 1 times [2024-09-25 00:09:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:17,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481421069] [2024-09-25 00:09:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:17,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:17,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:17,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:17,973 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 00:09:17,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481421069] [2024-09-25 00:09:17,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481421069] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980449673] [2024-09-25 00:09:17,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:17,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:17,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:17,978 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 00:09:17,980 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 00:09:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:18,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:09:18,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:09:18,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:18,466 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 00:09:18,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980449673] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:18,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:18,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-09-25 00:09:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439856122] [2024-09-25 00:09:18,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:18,470 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 00:09:18,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:18,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 00:09:18,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-09-25 00:09:18,471 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:09:18,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:18,527 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-09-25 00:09:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:09:18,528 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 19 [2024-09-25 00:09:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:18,529 INFO L225 Difference]: With dead ends: 25 [2024-09-25 00:09:18,529 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 00:09:18,530 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:09:18,531 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:18,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 00:09:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-25 00:09:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 00:09:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-25 00:09:18,538 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2024-09-25 00:09:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:18,539 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-25 00:09:18,539 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:09:18,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-25 00:09:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 00:09:18,541 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:18,541 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:18,563 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 00:09:18,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:18,743 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:18,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1955994435, now seen corresponding path program 2 times [2024-09-25 00:09:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41737282] [2024-09-25 00:09:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:18,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:18,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:18,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:18,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:09:18,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:18,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41737282] [2024-09-25 00:09:18,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41737282] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:18,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158081951] [2024-09-25 00:09:18,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:09:18,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:18,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:18,976 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 00:09:18,977 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 00:09:19,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:09:19,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:19,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:09:19,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 00:09:19,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 00:09:19,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158081951] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:19,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:19,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 14 [2024-09-25 00:09:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145078574] [2024-09-25 00:09:19,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:19,435 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 00:09:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 00:09:19,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-09-25 00:09:19,441 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-25 00:09:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:19,537 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-09-25 00:09:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:09:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 25 [2024-09-25 00:09:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:19,539 INFO L225 Difference]: With dead ends: 28 [2024-09-25 00:09:19,539 INFO L226 Difference]: Without dead ends: 24 [2024-09-25 00:09:19,540 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:09:19,541 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:19,541 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-25 00:09:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-25 00:09:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 00:09:19,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-09-25 00:09:19,553 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2024-09-25 00:09:19,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:19,553 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-09-25 00:09:19,553 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-25 00:09:19,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:19,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-09-25 00:09:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 00:09:19,558 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:19,558 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:19,577 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:09:19,758 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:19,759 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:19,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1072241521, now seen corresponding path program 3 times [2024-09-25 00:09:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:19,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42022665] [2024-09-25 00:09:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:19,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:19,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:19,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:19,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:19,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:09:20,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:20,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42022665] [2024-09-25 00:09:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42022665] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:20,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538509052] [2024-09-25 00:09:20,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:09:20,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:20,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:20,009 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 00:09:20,011 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 00:09:20,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 00:09:20,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:20,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 00:09:20,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:09:20,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:09:20,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538509052] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:20,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:20,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 16 [2024-09-25 00:09:20,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690669206] [2024-09-25 00:09:20,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:20,645 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 00:09:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 00:09:20,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:09:20,647 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-25 00:09:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:20,739 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-09-25 00:09:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 00:09:20,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) Word has length 31 [2024-09-25 00:09:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:20,742 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:09:20,742 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 00:09:20,742 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-09-25 00:09:20,743 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:20,743 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 74 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 00:09:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-25 00:09:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 00:09:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-25 00:09:20,753 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2024-09-25 00:09:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:20,753 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-25 00:09:20,753 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-25 00:09:20,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-25 00:09:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 00:09:20,757 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:20,757 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:20,780 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 00:09:20,965 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:20,966 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:20,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:20,966 INFO L85 PathProgramCache]: Analyzing trace with hash -790562051, now seen corresponding path program 4 times [2024-09-25 00:09:20,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:20,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848445313] [2024-09-25 00:09:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:20,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:21,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:21,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:21,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:21,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:21,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:21,233 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:21,269 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-25 00:09:21,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:21,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848445313] [2024-09-25 00:09:21,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848445313] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:21,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955777893] [2024-09-25 00:09:21,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 00:09:21,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:21,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:21,274 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 00:09:21,276 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 00:09:21,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 00:09:21,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:21,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 00:09:21,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 00:09:21,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 00:09:22,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955777893] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:22,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:22,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 18 [2024-09-25 00:09:22,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196808621] [2024-09-25 00:09:22,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:22,159 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 00:09:22,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:22,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 00:09:22,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-09-25 00:09:22,161 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2024-09-25 00:09:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:22,243 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-09-25 00:09:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:09:22,244 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) Word has length 37 [2024-09-25 00:09:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:22,247 INFO L225 Difference]: With dead ends: 34 [2024-09-25 00:09:22,248 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 00:09:22,248 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2024-09-25 00:09:22,249 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:22,250 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 90 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 00:09:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-25 00:09:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 00:09:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-09-25 00:09:22,260 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2024-09-25 00:09:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:22,262 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-09-25 00:09:22,263 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2024-09-25 00:09:22,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-09-25 00:09:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 00:09:22,265 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:22,265 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:22,283 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 00:09:22,469 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:22,470 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:22,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash 446137679, now seen corresponding path program 5 times [2024-09-25 00:09:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:22,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681570576] [2024-09-25 00:09:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:22,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:22,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:22,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:22,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:22,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:22,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:22,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:22,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:22,780 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-25 00:09:22,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:22,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681570576] [2024-09-25 00:09:22,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681570576] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:22,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367435379] [2024-09-25 00:09:22,781 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 00:09:22,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:22,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:22,783 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 00:09:22,785 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 00:09:22,842 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-09-25 00:09:22,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:22,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 00:09:22,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 00:09:22,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:09:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367435379] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:23,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:23,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 20 [2024-09-25 00:09:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336890591] [2024-09-25 00:09:23,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:23,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 00:09:23,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:23,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 00:09:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-09-25 00:09:23,989 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 20 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:09:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:24,092 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-09-25 00:09:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 00:09:24,093 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) Word has length 43 [2024-09-25 00:09:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:24,094 INFO L225 Difference]: With dead ends: 37 [2024-09-25 00:09:24,094 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 00:09:24,095 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2024-09-25 00:09:24,096 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:24,097 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 86 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 00:09:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-25 00:09:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-25 00:09:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-09-25 00:09:24,108 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2024-09-25 00:09:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:24,108 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-09-25 00:09:24,109 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:09:24,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-09-25 00:09:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 00:09:24,111 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:24,111 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:24,127 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:24,311 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 00:09:24,312 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:24,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1764409661, now seen corresponding path program 6 times [2024-09-25 00:09:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132842090] [2024-09-25 00:09:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,385 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-25 00:09:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132842090] [2024-09-25 00:09:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132842090] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452899121] [2024-09-25 00:09:24,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 00:09:24,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:24,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:24,678 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 00:09:24,680 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 00:09:24,760 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-09-25 00:09:24,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:24,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 00:09:24,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 00:09:24,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 00:09:26,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452899121] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:26,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:26,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 22 [2024-09-25 00:09:26,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566986038] [2024-09-25 00:09:26,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:26,270 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 00:09:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 00:09:26,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-09-25 00:09:26,272 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-09-25 00:09:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:26,374 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-09-25 00:09:26,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 00:09:26,374 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) Word has length 49 [2024-09-25 00:09:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:26,375 INFO L225 Difference]: With dead ends: 40 [2024-09-25 00:09:26,375 INFO L226 Difference]: Without dead ends: 36 [2024-09-25 00:09:26,376 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2024-09-25 00:09:26,377 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:26,377 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-25 00:09:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-25 00:09:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-25 00:09:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-09-25 00:09:26,383 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2024-09-25 00:09:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:26,383 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-09-25 00:09:26,383 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-09-25 00:09:26,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-09-25 00:09:26,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-25 00:09:26,384 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:26,384 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:26,399 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 00:09:26,588 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:26,589 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:26,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:26,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1097922063, now seen corresponding path program 7 times [2024-09-25 00:09:26,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:26,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401203222] [2024-09-25 00:09:26,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:26,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-25 00:09:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401203222] [2024-09-25 00:09:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401203222] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723883493] [2024-09-25 00:09:26,964 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 00:09:26,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:26,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:26,966 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 00:09:26,968 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 00:09:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 00:09:27,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-09-25 00:09:27,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 00:09:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723883493] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:29,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 19] total 24 [2024-09-25 00:09:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797513205] [2024-09-25 00:09:29,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:29,034 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:09:29,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:29,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:09:29,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:09:29,036 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2024-09-25 00:09:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:29,149 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-09-25 00:09:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 00:09:29,150 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) Word has length 55 [2024-09-25 00:09:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:29,151 INFO L225 Difference]: With dead ends: 43 [2024-09-25 00:09:29,151 INFO L226 Difference]: Without dead ends: 39 [2024-09-25 00:09:29,152 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=293, Invalid=637, Unknown=0, NotChecked=0, Total=930 [2024-09-25 00:09:29,152 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 81 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:29,153 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 116 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-25 00:09:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-25 00:09:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 10 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-25 00:09:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-09-25 00:09:29,159 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2024-09-25 00:09:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:29,160 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-09-25 00:09:29,160 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2024-09-25 00:09:29,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-09-25 00:09:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-25 00:09:29,162 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:29,162 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:29,180 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:29,362 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:29,363 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:29,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash 401815421, now seen corresponding path program 8 times [2024-09-25 00:09:29,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:29,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599257819] [2024-09-25 00:09:29,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,792 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-09-25 00:09:29,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599257819] [2024-09-25 00:09:29,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599257819] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:29,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357550676] [2024-09-25 00:09:29,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:09:29,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:29,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:29,849 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 00:09:29,850 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 00:09:29,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:09:29,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:29,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-25 00:09:29,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-09-25 00:09:30,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 00:09:32,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357550676] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:32,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:32,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 21] total 26 [2024-09-25 00:09:32,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800941498] [2024-09-25 00:09:32,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:32,620 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 00:09:32,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:32,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 00:09:32,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2024-09-25 00:09:32,622 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 26 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) [2024-09-25 00:09:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:32,734 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-09-25 00:09:32,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 00:09:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) Word has length 61 [2024-09-25 00:09:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:32,736 INFO L225 Difference]: With dead ends: 46 [2024-09-25 00:09:32,736 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 00:09:32,737 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=355, Invalid=767, Unknown=0, NotChecked=0, Total=1122 [2024-09-25 00:09:32,737 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:32,738 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 121 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 00:09:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-25 00:09:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-25 00:09:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-09-25 00:09:32,746 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2024-09-25 00:09:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:32,747 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-09-25 00:09:32,747 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) [2024-09-25 00:09:32,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-09-25 00:09:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-25 00:09:32,748 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:32,748 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:32,762 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:32,949 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:32,950 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:32,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash -281594161, now seen corresponding path program 9 times [2024-09-25 00:09:32,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:32,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146654694] [2024-09-25 00:09:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:32,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-09-25 00:09:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146654694] [2024-09-25 00:09:33,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146654694] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:33,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275637861] [2024-09-25 00:09:33,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:09:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:33,449 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 00:09:33,451 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 00:09:33,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-25 00:09:33,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:33,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-25 00:09:33,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-09-25 00:09:33,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-25 00:09:36,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275637861] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:36,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:36,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2024-09-25 00:09:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577447429] [2024-09-25 00:09:36,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:36,954 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-25 00:09:36,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:36,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-25 00:09:36,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2024-09-25 00:09:36,956 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) [2024-09-25 00:09:37,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:37,074 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-09-25 00:09:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 00:09:37,075 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) Word has length 67 [2024-09-25 00:09:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:37,076 INFO L225 Difference]: With dead ends: 49 [2024-09-25 00:09:37,076 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 00:09:37,077 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=420, Invalid=840, Unknown=0, NotChecked=0, Total=1260 [2024-09-25 00:09:37,077 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:37,078 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 136 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 00:09:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-25 00:09:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 12 states have return successors, (13), 12 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-25 00:09:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-09-25 00:09:37,084 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2024-09-25 00:09:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:37,085 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-09-25 00:09:37,085 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) [2024-09-25 00:09:37,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-09-25 00:09:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-25 00:09:37,087 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:37,087 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:37,107 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 00:09:37,287 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 00:09:37,288 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:37,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash 132537789, now seen corresponding path program 10 times [2024-09-25 00:09:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487169827] [2024-09-25 00:09:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:37,422 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:37,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:37,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:37,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:37,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:37,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:37,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:37,955 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:38,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:38,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:38,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:38,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 10 proven. 155 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-09-25 00:09:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487169827] [2024-09-25 00:09:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487169827] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698098237] [2024-09-25 00:09:38,233 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 00:09:38,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:38,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:38,235 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 00:09:38,237 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 00:09:38,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 00:09:38,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:38,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-09-25 00:09:38,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-09-25 00:09:38,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-09-25 00:09:38,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698098237] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:38,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:38,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 27 [2024-09-25 00:09:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554631721] [2024-09-25 00:09:38,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:38,994 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-25 00:09:38,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:38,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-25 00:09:38,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2024-09-25 00:09:38,995 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) [2024-09-25 00:09:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:39,497 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-09-25 00:09:39,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-25 00:09:39,498 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) Word has length 73 [2024-09-25 00:09:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:39,499 INFO L225 Difference]: With dead ends: 52 [2024-09-25 00:09:39,499 INFO L226 Difference]: Without dead ends: 48 [2024-09-25 00:09:39,500 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=2030, Unknown=0, NotChecked=0, Total=2162 [2024-09-25 00:09:39,501 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:39,501 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 452 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:09:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-25 00:09:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-25 00:09:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 13 states have return successors, (14), 13 states have call predecessors, (14), 3 states have call successors, (14) [2024-09-25 00:09:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-09-25 00:09:39,508 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2024-09-25 00:09:39,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:39,509 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-09-25 00:09:39,509 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) [2024-09-25 00:09:39,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:39,509 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-09-25 00:09:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-25 00:09:39,510 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:39,510 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:39,528 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:39,711 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 00:09:39,711 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:39,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:39,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2004764559, now seen corresponding path program 11 times [2024-09-25 00:09:39,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:39,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13357747] [2024-09-25 00:09:39,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:39,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:39,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:39,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:39,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 165 proven. 33 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-09-25 00:09:40,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:40,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13357747] [2024-09-25 00:09:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13357747] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:40,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158002293] [2024-09-25 00:09:40,462 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 00:09:40,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:40,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:40,464 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 00:09:40,466 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 00:09:40,673 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-09-25 00:09:40,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:40,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-25 00:09:40,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-09-25 00:09:40,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:09:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158002293] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:40,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:09:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 19 [2024-09-25 00:09:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197567850] [2024-09-25 00:09:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:40,786 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 00:09:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 00:09:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-09-25 00:09:40,787 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-25 00:09:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:40,943 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-09-25 00:09:40,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 00:09:40,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2024-09-25 00:09:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:40,944 INFO L225 Difference]: With dead ends: 48 [2024-09-25 00:09:40,944 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:09:40,946 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=600, Unknown=0, NotChecked=0, Total=870 [2024-09-25 00:09:40,947 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:40,948 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:09:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:09:40,948 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 00:09:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:09:40,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-09-25 00:09:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:40,949 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:09:40,949 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-25 00:09:40,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:09:40,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:09:40,953 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:09:40,972 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:41,157 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:41,162 INFO L408 BasicCegarLoop]: Path program histogram: [11, 1] [2024-09-25 00:09:41,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:09:41,913 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:09:41,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:09:41 BoogieIcfgContainer [2024-09-25 00:09:41,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:09:41,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:09:41,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:09:41,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:09:41,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:17" (3/4) ... [2024-09-25 00:09:41,965 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:09:42,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:09:42,050 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:09:42,050 INFO L158 Benchmark]: Toolchain (without parser) took 25651.65ms. Allocated memory was 130.0MB in the beginning and 247.5MB in the end (delta: 117.4MB). Free memory was 61.4MB in the beginning and 150.2MB in the end (delta: -88.8MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2024-09-25 00:09:42,051 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:09:42,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.08ms. Allocated memory is still 130.0MB. Free memory was 61.1MB in the beginning and 101.0MB in the end (delta: -39.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-09-25 00:09:42,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.69ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 101.0MB in the beginning and 142.9MB in the end (delta: -41.9MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-09-25 00:09:42,052 INFO L158 Benchmark]: Boogie Preprocessor took 27.73ms. Allocated memory is still 169.9MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:09:42,052 INFO L158 Benchmark]: RCFGBuilder took 347.23ms. Allocated memory is still 169.9MB. Free memory was 140.8MB in the beginning and 129.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 00:09:42,053 INFO L158 Benchmark]: TraceAbstraction took 24894.97ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 129.4MB in the beginning and 153.7MB in the end (delta: -24.3MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2024-09-25 00:09:42,053 INFO L158 Benchmark]: Witness Printer took 88.81ms. Allocated memory is still 247.5MB. Free memory was 153.7MB in the beginning and 150.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 00:09:42,055 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.23ms. Allocated memory is still 130.0MB. Free memory is still 82.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.08ms. Allocated memory is still 130.0MB. Free memory was 61.1MB in the beginning and 101.0MB in the end (delta: -39.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.69ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 101.0MB in the beginning and 142.9MB in the end (delta: -41.9MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.73ms. Allocated memory is still 169.9MB. Free memory was 142.9MB in the beginning and 140.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 347.23ms. Allocated memory is still 169.9MB. Free memory was 140.8MB in the beginning and 129.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24894.97ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 129.4MB in the beginning and 153.7MB in the end (delta: -24.3MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. * Witness Printer took 88.81ms. Allocated memory is still 247.5MB. Free memory was 153.7MB in the beginning and 150.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: 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 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 1462 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1278 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1270 IncrementalHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 184 mSDtfsCounter, 1270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1369 GetRequests, 1032 SyntacticMatches, 55 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=11, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 1091 NumberOfCodeBlocks, 1085 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1518 ConstructedInterpolants, 0 QuantifiedInterpolants, 3978 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 33 InterpolantComputations, 2 PerfectInterpolantSequences, 2200/4378 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: 6]: Procedure Contract for id Derived contract for procedure id. Ensures: (((((((((((((3 == \result) && (x == 3)) || ((x == 6) && (6 == \result))) || ((9 == \result) && (x == 9))) || ((2 == \result) && (x == 2))) || ((10 == \result) && (x == 10))) || ((5 == \result) && (5 == x))) || ((8 == \result) && (x == 8))) || ((7 == \result) && (7 == x))) || (10 < x)) || ((\result == 1) && (x == 1))) || ((x == 4) && (4 == \result))) || ((\result == 0) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:09:42,091 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