./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.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 74bed2c5921e53f16e234cbc0a2deaaf4b0b51c6cc3f20bfab2fd33a0fce7ecf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:44:44,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:44:44,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:44:44,663 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:44:44,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:44:44,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:44:44,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:44:44,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:44:44,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:44:44,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:44:44,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:44:44,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:44:44,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:44:44,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:44:44,707 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:44:44,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:44:44,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:44:44,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:44:44,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:44:44,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:44:44,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:44:44,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:44:44,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:44:44,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:44:44,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:44:44,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:44:44,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:44:44,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:44:44,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:44:44,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:44:44,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:44:44,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:44:44,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:44:44,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:44:44,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:44:44,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:44:44,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:44:44,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:44:44,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:44:44,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:44:44,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:44:44,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:44:44,718 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 -> 74bed2c5921e53f16e234cbc0a2deaaf4b0b51c6cc3f20bfab2fd33a0fce7ecf 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 [2024-09-11 19:44:44,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:44:44,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:44:44,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:44:44,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:44:44,985 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:44:44,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c [2024-09-11 19:44:46,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:44:46,577 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:44:46,577 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c [2024-09-11 19:44:46,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/bf6aedbb7/e9d8790f70b4445bba6d1f2f2b7e8ed1/FLAG71badc9b7 [2024-09-11 19:44:46,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/bf6aedbb7/e9d8790f70b4445bba6d1f2f2b7e8ed1 [2024-09-11 19:44:46,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:44:46,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:44:46,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:44:46,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:44:46,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:44:46,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7901260f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46, skipping insertion in model container [2024-09-11 19:44:46,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:44:46,791 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2024-09-11 19:44:46,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:44:46,833 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:44:46,844 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound10.c[525,538] [2024-09-11 19:44:46,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:44:46,875 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:44:46,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46 WrapperNode [2024-09-11 19:44:46,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:44:46,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:44:46,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:44:46,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:44:46,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,915 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-09-11 19:44:46,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:44:46,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:44:46,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:44:46,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:44:46,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,943 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-11 19:44:46,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:44:46,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:44:46,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:44:46,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:44:46,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (1/1) ... [2024-09-11 19:44:46,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:44:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:44:46,984 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-11 19:44:46,989 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-11 19:44:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:44:47,026 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:44:47,026 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:44:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:44:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:44:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:44:47,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:44:47,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:44:47,078 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:44:47,080 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:44:47,272 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 19:44:47,272 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:44:47,294 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:44:47,297 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:44:47,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:44:47 BoogieIcfgContainer [2024-09-11 19:44:47,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:44:47,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:44:47,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:44:47,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:44:47,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:44:46" (1/3) ... [2024-09-11 19:44:47,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b94977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:44:47, skipping insertion in model container [2024-09-11 19:44:47,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:46" (2/3) ... [2024-09-11 19:44:47,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b94977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:44:47, skipping insertion in model container [2024-09-11 19:44:47,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:44:47" (3/3) ... [2024-09-11 19:44:47,311 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound10.c [2024-09-11 19:44:47,325 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:44:47,325 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:44:47,371 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:44:47,376 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;@391cb52a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:44:47,376 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:44:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:44:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 19:44:47,386 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:47,387 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:47,387 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:47,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -10312671, now seen corresponding path program 1 times [2024-09-11 19:44:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:47,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885171884] [2024-09-11 19:44:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:47,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:47,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885171884] [2024-09-11 19:44:47,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885171884] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:44:47,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:44:47,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:44:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993984260] [2024-09-11 19:44:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:44:47,557 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:44:47,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:44:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:44:47,577 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:44:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:44:47,602 INFO L93 Difference]: Finished difference Result 58 states and 102 transitions. [2024-09-11 19:44:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:44:47,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-11 19:44:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:44:47,612 INFO L225 Difference]: With dead ends: 58 [2024-09-11 19:44:47,612 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 19:44:47,615 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:44:47,617 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:44:47,618 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:44:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 19:44:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 19:44:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 19:44:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-09-11 19:44:47,650 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2024-09-11 19:44:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:44:47,651 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-09-11 19:44:47,651 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:44:47,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2024-09-11 19:44:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:44:47,653 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:47,654 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:47,654 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:44:47,654 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:47,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:47,655 INFO L85 PathProgramCache]: Analyzing trace with hash 763841584, now seen corresponding path program 1 times [2024-09-11 19:44:47,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:47,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036507467] [2024-09-11 19:44:47,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:47,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:48,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:48,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:48,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:48,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:48,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036507467] [2024-09-11 19:44:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036507467] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:44:48,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:44:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:44:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974843354] [2024-09-11 19:44:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:44:48,236 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:44:48,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:44:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:44:48,237 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:44:49,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:44:53,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:44:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:44:53,678 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2024-09-11 19:44:53,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:44:53,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-11 19:44:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:44:53,690 INFO L225 Difference]: With dead ends: 60 [2024-09-11 19:44:53,690 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 19:44:53,690 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:44:53,691 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:44:53,692 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 158 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-09-11 19:44:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 19:44:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 19:44:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 19:44:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-09-11 19:44:53,716 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2024-09-11 19:44:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:44:53,716 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-09-11 19:44:53,716 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:44:53,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-09-11 19:44:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:44:53,718 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:53,719 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:53,719 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:44:53,719 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:53,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash -82339253, now seen corresponding path program 1 times [2024-09-11 19:44:53,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239280029] [2024-09-11 19:44:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:53,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:54,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:54,129 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:54,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:54,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239280029] [2024-09-11 19:44:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239280029] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:44:54,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214192073] [2024-09-11 19:44:54,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:54,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:44:54,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:44:54,137 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-11 19:44:54,139 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-11 19:44:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:54,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:44:54,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:44:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:54,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:44:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:54,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214192073] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:44:54,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:44:54,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-11 19:44:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803246017] [2024-09-11 19:44:54,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:44:54,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:44:54,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:54,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:44:54,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:44:54,635 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:44:57,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:44:58,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:44:58,399 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2024-09-11 19:44:58,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:44:58,399 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-11 19:44:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:44:58,402 INFO L225 Difference]: With dead ends: 111 [2024-09-11 19:44:58,402 INFO L226 Difference]: Without dead ends: 93 [2024-09-11 19:44:58,403 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-11 19:44:58,404 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-09-11 19:44:58,404 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 269 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-09-11 19:44:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-11 19:44:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2024-09-11 19:44:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-11 19:44:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-09-11 19:44:58,425 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 21 [2024-09-11 19:44:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:44:58,426 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-09-11 19:44:58,426 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:44:58,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-09-11 19:44:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-11 19:44:58,428 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:58,428 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:58,445 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:44:58,632 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:44:58,633 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:58,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash -93184560, now seen corresponding path program 1 times [2024-09-11 19:44:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:58,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576304305] [2024-09-11 19:44:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:44:58,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212010963] [2024-09-11 19:44:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:58,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:44:58,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:44:58,670 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-11 19:44:58,673 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-11 19:44:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:58,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:44:58,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:44:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:44:58,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:44:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:58,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576304305] [2024-09-11 19:44:58,777 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:44:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212010963] [2024-09-11 19:44:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212010963] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:44:58,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:44:58,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:44:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143569237] [2024-09-11 19:44:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:44:58,778 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:44:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:44:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:44:58,779 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:44:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:44:58,922 INFO L93 Difference]: Finished difference Result 86 states and 123 transitions. [2024-09-11 19:44:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:44:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-11 19:44:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:44:58,924 INFO L225 Difference]: With dead ends: 86 [2024-09-11 19:44:58,924 INFO L226 Difference]: Without dead ends: 83 [2024-09-11 19:44:58,925 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:44:58,926 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:44:58,926 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:44:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-11 19:44:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-09-11 19:44:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-09-11 19:44:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-09-11 19:44:58,946 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 29 [2024-09-11 19:44:58,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:44:58,947 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-09-11 19:44:58,947 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:44:58,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-09-11 19:44:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 19:44:58,949 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:58,949 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:58,965 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:44:59,149 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:44:59,150 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:59,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash 471953405, now seen corresponding path program 1 times [2024-09-11 19:44:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:59,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780012177] [2024-09-11 19:44:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:44:59,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [894728701] [2024-09-11 19:44:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:59,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:44:59,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:44:59,178 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-11 19:44:59,180 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-11 19:44:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:59,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 19:44:59,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:44:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:59,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:45:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780012177] [2024-09-11 19:45:00,995 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:45:00,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894728701] [2024-09-11 19:45:00,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894728701] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:45:00,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:45:00,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 19:45:00,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375528199] [2024-09-11 19:45:00,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:45:00,996 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:45:00,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:00,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:45:00,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:45:00,996 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 19:45:06,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:11,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:17,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:21,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:23,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:27,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:31,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:35,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:39,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:43,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:47,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:51,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:56,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:01,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:46:01,200 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2024-09-11 19:46:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:46:01,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-09-11 19:46:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:46:01,202 INFO L225 Difference]: With dead ends: 152 [2024-09-11 19:46:01,203 INFO L226 Difference]: Without dead ends: 128 [2024-09-11 19:46:01,204 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:46:01,204 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 55 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:46:01,204 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 270 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 191 Invalid, 12 Unknown, 0 Unchecked, 58.4s Time] [2024-09-11 19:46:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-09-11 19:46:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2024-09-11 19:46:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 60 states have internal predecessors, (68), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-11 19:46:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2024-09-11 19:46:01,236 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 28 [2024-09-11 19:46:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:46:01,237 INFO L474 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2024-09-11 19:46:01,237 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 19:46:01,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-09-11 19:46:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 19:46:01,239 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:46:01,239 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:46:01,248 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:46:01,443 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:46:01,444 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:46:01,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash -416609438, now seen corresponding path program 1 times [2024-09-11 19:46:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:46:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819802745] [2024-09-11 19:46:01,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:46:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:01,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:46:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:01,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:46:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:01,702 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 19:46:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:01,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 19:46:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:01,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 19:46:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:46:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:46:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819802745] [2024-09-11 19:46:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819802745] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:46:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973588653] [2024-09-11 19:46:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:01,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:46:01,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:46:01,720 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-11 19:46:01,722 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-11 19:46:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:01,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:46:01,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:46:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-11 19:46:01,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:46:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:46:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973588653] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:46:02,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:46:02,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-09-11 19:46:02,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300502023] [2024-09-11 19:46:02,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:46:02,082 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:46:02,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:46:02,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:46:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:46:02,083 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-11 19:46:06,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:46:10,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:46:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:46:11,543 INFO L93 Difference]: Finished difference Result 173 states and 248 transitions. [2024-09-11 19:46:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 19:46:11,544 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 40 [2024-09-11 19:46:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:46:11,546 INFO L225 Difference]: With dead ends: 173 [2024-09-11 19:46:11,546 INFO L226 Difference]: Without dead ends: 131 [2024-09-11 19:46:11,547 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:46:11,547 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 79 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:46:11,548 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 461 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 230 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-09-11 19:46:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-11 19:46:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2024-09-11 19:46:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-11 19:46:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-09-11 19:46:11,582 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 40 [2024-09-11 19:46:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:46:11,583 INFO L474 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-09-11 19:46:11,583 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-11 19:46:11,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-09-11 19:46:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 19:46:11,588 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:46:11,588 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:46:11,607 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:46:11,792 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:46:11,793 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:46:11,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash -208842498, now seen corresponding path program 1 times [2024-09-11 19:46:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:46:11,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659841811] [2024-09-11 19:46:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:11,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:46:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:46:11,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450786673] [2024-09-11 19:46:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:11,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:46:11,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:46:11,834 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-11 19:46:11,836 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-11 19:46:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:11,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-11 19:46:11,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:46:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-11 19:46:12,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:46:37,943 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-11 19:46:37,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:46:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659841811] [2024-09-11 19:46:37,944 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:46:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450786673] [2024-09-11 19:46:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450786673] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:46:37,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:46:37,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-09-11 19:46:37,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616035537] [2024-09-11 19:46:37,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:46:37,945 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:46:37,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:46:37,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:46:37,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=79, Unknown=2, NotChecked=0, Total=110 [2024-09-11 19:46:37,946 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-11 19:46:42,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:47,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:51,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:55,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:46:59,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:47:03,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:47:07,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:47:11,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:47:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:47:12,064 INFO L93 Difference]: Finished difference Result 129 states and 180 transitions. [2024-09-11 19:47:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:47:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 55 [2024-09-11 19:47:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:47:12,067 INFO L225 Difference]: With dead ends: 129 [2024-09-11 19:47:12,067 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 19:47:12,068 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=36, Invalid=94, Unknown=2, NotChecked=0, Total=132 [2024-09-11 19:47:12,068 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 36 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:47:12,068 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 89 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 34.1s Time] [2024-09-11 19:47:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 19:47:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-09-11 19:47:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-09-11 19:47:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2024-09-11 19:47:12,091 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 55 [2024-09-11 19:47:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:47:12,091 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2024-09-11 19:47:12,092 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-11 19:47:12,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:47:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2024-09-11 19:47:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-11 19:47:12,093 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:47:12,094 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:47:12,108 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-11 19:47:12,297 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:47:12,298 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:47:12,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:47:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2119770422, now seen corresponding path program 1 times [2024-09-11 19:47:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:47:12,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076269521] [2024-09-11 19:47:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:47:12,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:47:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:47:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:47:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:47:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 19:47:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:47:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:47:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,469 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 19:47:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 19:47:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-11 19:47:13,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:47:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076269521] [2024-09-11 19:47:13,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076269521] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:47:13,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217644100] [2024-09-11 19:47:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:47:13,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:47:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:47:13,504 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-11 19:47:13,505 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-11 19:47:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:13,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-11 19:47:13,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:47:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-11 19:47:14,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:47:31,558 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:47:56,185 WARN L293 SmtUtils]: Spent 16.14s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:48:12,701 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:48:25,053 WARN L293 SmtUtils]: Spent 12.34s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:48:42,000 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:48:54,049 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:49:10,343 WARN L293 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:49:14,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* 2 (div (mod |c_ULTIMATE.start_main_~p~0#1| 4294967296) 2))) (.cse0 (div (mod |c_ULTIMATE.start_main_~q~0#1| 4294967296) 4))) (let ((.cse5 (* (div (+ .cse6 (* .cse0 3)) 4294967296) 4294967296)) (.cse7 (* (div (+ (* (- 1) .cse0) (* (- 1) |c_ULTIMATE.start_main_~p~0#1|)) 4294967296) 4294967296)) (.cse8 (* .cse0 4)) (.cse1 (* |c_ULTIMATE.start_main_~n~0#1| 4294967292 |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~q~0#1|)) (.cse2 (* |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~p~0#1| 4 |c_ULTIMATE.start_main_~q~0#1|)) (.cse3 (* |c_ULTIMATE.start_main_~p~0#1| |c_ULTIMATE.start_main_~h~0#1| |c_ULTIMATE.start_main_~h~0#1|)) (.cse4 (* |c_ULTIMATE.start_main_~p~0#1| 4294967295 |c_ULTIMATE.start_main_~q~0#1| |c_ULTIMATE.start_main_~q~0#1|)) (.cse10 (mod (+ (* |c_ULTIMATE.start_main_~p~0#1| 2) |c_ULTIMATE.start_main_~q~0#1|) 4294967296))) (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse9 (* v_y_6 4294967296))) (or (< 4294967295 (+ v_z_6 (mod (+ (* .cse0 4294967295) (* |c_ULTIMATE.start_main_~p~0#1| 4294967295)) 4294967296))) (< v_z_6 0) (not (= (mod (+ .cse1 .cse2 .cse3 .cse4 (* |c_ULTIMATE.start_main_~h~0#1| v_z_6 4 |c_ULTIMATE.start_main_~q~0#1|) (* 4294967292 |c_ULTIMATE.start_main_~p~0#1| v_z_6 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) 0)) (< (+ .cse5 v_z_6) (+ .cse6 .cse7 |c_ULTIMATE.start_main_~p~0#1| .cse8)) (< (+ .cse9 v_z_6) (mod (+ .cse0 |c_ULTIMATE.start_main_~p~0#1|) 4294967296)) (< .cse10 (+ .cse9 v_z_6 1))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse11 (* v_y_6 4294967296))) (or (< 4294967295 v_z_6) (< (+ .cse11 v_z_6) 0) (< (+ .cse5 v_z_6) (+ .cse6 .cse7 |c_ULTIMATE.start_main_~p~0#1| 4294967296 .cse8)) (not (= (mod (+ .cse1 .cse2 .cse3 .cse4 (* |c_ULTIMATE.start_main_~h~0#1| v_z_6 4 |c_ULTIMATE.start_main_~q~0#1|) (* 4294967292 |c_ULTIMATE.start_main_~p~0#1| v_z_6 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) 0)) (< .cse10 (+ .cse11 v_z_6 1)))))))) is different from false [2024-09-11 19:49:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217644100] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:49:14,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:49:14,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 20 [2024-09-11 19:49:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999756340] [2024-09-11 19:49:14,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:49:14,390 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 19:49:14,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:14,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 19:49:14,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=474, Unknown=1, NotChecked=44, Total=600 [2024-09-11 19:49:14,391 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 7 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-09-11 19:49:19,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []